P1181 数列分段 Section I

数列分段 Section I - 洛谷

/** @Description: To iterate is human, to recurse divine.* @Autor: Recursion* @Date: 2022-04-11 14:35:08* @LastEditTime: 2022-04-11 14:49:15*/
#include <bits/stdc++.h>
#define LL long long 
using namespace std;
const int maxn = 1e6 + 10;
const int mod = 1e9 + 7;
const int INF = 1e9 + 10;
const int N = 1e6;
int n,m,ans,temp;
int a[N];
int main()
{ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);cin >> n >> m;for(int i = 1;i <= n;i ++)cin >> a[i];for(int i = 1;i <= n;i ++){if(temp + a[i] > m){temp = 0;ans ++;i --;continue;}temp += a[i];}cout << ans + 1 << endl;return 0;
}