poj3061—1

#include <iostream>#include<cstdio>#include<algorithm>#include<string.h>using namespace std;int T,n,s,a[100005];int main(){    scanf("%d",&T);    while(T--)    {        scanf("%d%d",&n,&s);        for(int i=0;i<n;i++)            scanf("%d",&a[i]);        int st,last,sum,minum,t;        sum=st=last=0;        minum=1000000;        while(last<n)        {            while(sum<s&&last<n)            {            sum+=a[last++];            }           while(sum>=s)           {               minum=min(last-st,minum);               sum-=a[st++];           }        }        if(minum<=n)        printf("%d\n",minum);        else printf("0\n");    }    return 0;}

这次使用了取尺法，不过运行时间似乎并未减少