LA 2678 Subsequence

#include<iostream>
#include<cstdio>
#include<cstring>
#include <cmath>
#include<stack>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<algorithm>
using namespace std;

typedef long long LL;
const int INF = (1<<30)-1;
const int mod=1000000007;
const int maxn=100005;

int a[maxn];
int n,S;

void solve(){
int t = 0,s = 0;
int res = INF;
int sum = 0;
for(;;){
while(t < n && sum < S){
sum += a[t++];
}
if(sum < S) break;
res = min(res,t - s);
sum -= a[s++];
}
if(res > n) res = 0;
printf("%d\n",res);
}

int main(){
while(scanf("%d %d",&n,&S) != EOF){
memset(a,0,sizeof(a));
for(int i = 0;i < n;i++) scanf("%d",&a[i]);
solve();
}
return 0;
}