连续的数列 一遍扫过去就行了
AC代码
// luogu-judger-enable-o2
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e6+10;
int trie[MAXN][2];
const int mod = 998244353;
int arr[MAXN];
int main() {
int n, x;
cin >> n >> x;
for(int i = 0; i < n; i++) {
cin >> arr[i];
}
int sum = 0;
int k = 0;
for(int i = 0; i < n; i++) {
if(sum+arr[i] > x) {
sum = 0;
k++;
}
sum += arr[i];
}
if(sum) k++;
cout << k << endl;
return 0;
}