poj3061（尺取法）

#include <stack>
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>

using namespace std;
#define ll long long
#define ull unsigned long long
#define cls(x) memset(x,0,sizeof(x))
#define clslow(x) memset(x,-1,sizeof(x))

const int maxn=1e5+100;

int n,T,S;

int a[maxn];

int main()
{
//    freopen("in.txt","r",stdin);
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&S);
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i]);
        }

        int s=1,e=1;
        int ans=n+1,sum=0;
        while(true)
        {
            while(e<=n&&sum<S)  sum+=a[e++];
            if(sum<S)   break;
            ans=min(ans,e-s);
            sum-=a[s++];
        }
        if(ans==n+1)    ans=0;
        printf("%d\n",ans);
    }
    return 0;
}