题意:
解法:
枚举r,维护一个最小的l,满足sum[l,r]<=s即可,
l的移动显然是单调向右的.
用r-l+1更新答案即可.
code:
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxm=3e5+5;
int a[maxm];
int n,s;
void solve(){
cin>>n>>s;
for(int i=1;i<=n;i++)cin>>a[i];
int sum=0,l=1;
int ans=0;
for(int i=1;i<=n;i++){
sum+=a[i];
while(sum>s)sum-=a[l++];
ans=max(ans,i-l+1);
}
cout<<ans<<endl;
}
signed main(){
ios::sync_with_stdio(0);cin.tie(0);
solve();
return 0;
}