Subsequence

#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
int s, n;
int a[100005];
int main() {
int t;
while(scanf("%d%d", &n, &s) != EOF) {
for(int i=1; i<=n; i++) {
scanf("%d", &t);
a[i] = a[i-1] + t;
}
int ans = n+1;
int j=1;
for(int i=1; i<=n; i++) {
if(a[j-1] > a[i]-s) continue;//j-1意思是包含j
while(a[j-1] <= a[i]-s) j++;//多加了一个
ans = min(ans, i-j+1);//所以这里要补上
}
printf("%d\n", ans==n+1?0:ans+1);//长度是相减加一
}
return 0;
}