lanqiao OJ 1372 美丽的区间

#include<bits/stdc++.h>
using namespace std;
using ll =long long;
const int N=1e5+9;
int a[N];
int main(){//尺取法
	int n;cin>>n;
	ll S;cin>>S;
	int len=n+1;
	for(int i=1;i<=n;i++) cin>>a[i];
	int sum=0;
	int r=1,l=1;
	for(;r<=n;){
		if(sum<S){
			sum+=a[r];
			r++;
		}
		else{
			len=min(r-l,len);
			sum-=a[l];
			l++;
		}
	}
	if(len==n+1)cout<<0;
	else cout<<len;
 	return 0;
}