UVa OJ 1121

#include<cstdio>
#include<algorithm>
using namespace std;
int A[100010],B[100010];
int main(){
    int n,S;
    while(scanf("%d%d",&n,&S)==2){
       for(int i=1;i<=n;i++)
         scanf("%d",&A[i]);
       B[0]=0;
       for(int i=1;i<=n;i++) B[i]=B[i-1]+A[i];
       int ans=n+1;
       int i=1;
       for(int j=1;j<=n;j++){
          if(B[i-1]>B[j]-S) continue;
          while(B[i]<=B[j]-S)i++;
            ans=min(ans,j-i+1);
       }
       printf("%d\n",ans==n+1?0:ans);
    }
    return 0;
}