题意:
解法:
枚举r,维护最大的l,满足sum[l,r]>=s,
然后用r-l+1更新答案即可.
显然l的移动是向右单调的.
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=1e9;
for(int i=1;i<=n;i++){
sum+=a[i];
while(sum-a[l]>=s)sum-=a[l++];
if(sum>=s){
ans=min(ans,i-l+1);
}
}
if(ans==1e9)ans=-1;
cout<<ans<<endl;
}
signed main(){
ios::sync_with_stdio(0);cin.tie(0);
solve();
return 0;
}