提出 #53329883

---

ソースコード 拡げる

// #pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf (ll)1e18
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define fi first
#define se second
#define lll __int128
const int N = 1e6 + 5;
ll n, k, a[N];
void solve() {
	cin >> n >> k;
	for (ll i = 1; i <= n; i++)
		cin >> a[i];
	ll ans = 0;
	ll have = 0;
	for (ll i = 1; i <= n; i++) {
		if (k - have >= a[i])
			have += a[i];
		else
			ans++, have = a[i];
	}
	ans += have > 0;
	cout << ans << endl;
}
int main() {
	ios::sync_with_stdio(false);
  	cin.tie(0);
  	cout.tie(0);
	solve();
	return 0;
}

提出情報

ジャッジ結果