#include<bits/stdc++.h>
using namespace std;
class Solution{
public:
int solve(vector < int > num,int m)
{
int ans=1,sum=0;
for(int i=0; i<num.size(); i++)
{
if(sum+num[i]>m)
{
ans++;
sum=num[i];
}
else sum+=num[i];
}
return ans;
}
};
int main()
{
Solution x;
int n,m;vector < int > num;
cin>>n>>m;
for(int i=1,x; i<=n; i++)
{
cin>>x;
num.push_back(x);
}
cout<<x.solve(num,m)<<endl;
return 0;
}
#10006. 「一本通 1.1 练习 2」数列分段
最新推荐文章于 2024-07-11 17:21:10 发布