LA 2678 Subsequence

#include<cstdio>
#include<cstring>
#include<algorithm>
#define maxn 100009
using namespace std;

int sum[maxn];
int main()
{
int n,s,x;
while(scanf("%d%d",&n,&s)!=EOF)
{
memset(sum,0,sizeof sum);
int ans=n+1;
for(int i=1;i<=n;i++)
{
scanf("%d",&x);
sum[i]=sum[i-1]+x;
}
int j=1;
for(int i=1;i<=n;i++)
{
if(sum[j-1]>sum[i]-s)continue;
while(sum[j]<=sum[i]-s)j++;
ans=min(ans,i-j+1);
}
printf("%d\n",ans==n+1?0:ans);
}
return 0;
}