POJ 3061 - Subsequence

#include <iostream>
#include<cstdio>
using namespace std;
#define N 100005
int a
;
int main()
{
int m;
scanf("%d",&m);
while(m--)
{
int n,s;
scanf("%d%d",&n,&s);
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
int st=0,t=0,sum=0;
int ans=n+1;
while(1)
{
while(t<n&&sum<s)
{
sum+=a[t++];
}
if(sum<s)
break;
ans=min(ans,t-st);
sum-=a[st++];
}
if(ans>n)
{
ans=0;
}
printf("%d\n",ans);
}
return 0;
}