题解 | #良神吃点心#
良神吃点心
https://ac.nowcoder.com/acm/problem/14705
思路
贪心，每次固定左端点，然后向右边尽可能扩展即可。
代码
//#pragma GCC optimize("Ofast", "inline", "-ffast-math")
//#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include<bits/stdc++.h>
#define inf 0x3f3f3f3f
#define int long long
using namespace std;
const int N=2e5+7;
const int mod=1e9+7;
//int read(){ int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-') f=f*-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}return x*f;}
int n,m,a[N],sum[N],cnt=0;
signed main(){
// ios::sync_with_stdio(0);
// cin.tie(0);cout.tie(0);
// freopen("in.cpp","r",stdin);
// freopen("out.cpp","w",stdout);
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>a[i];
sum[i]=sum[i-1]+a[i];
}
int l=1,r=1;
while(l<=n){
while(r<n&&sum[r]-sum[l-1]+a[r+1]<=m) r++;
cnt++;
l=r+1;
}
cout<<cnt<<"\n";
return 0;
}
投递CVTE等公司9个岗位 >