uva1121 Subsequence(入门级)

int a[100001];
int n, s;
int main(int argc, const char * argv[])
{
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
while(scanf("%d%d",&n,&s) == 2)
{
int sum = 0;
int tail = 0;
int len = INF;
for (int i = 1;i <= n;++i)
{
scanf("%d", &a[i]);
sum += a[i];
while(sum >= s && tail < i)
{
sum -= a[++tail];
len = min(len, i - tail + 1);
}
}
if (len == INF) cout << 0 << endl;
else cout << len << endl;
}
return 0;
}