POJ 3061 Subsequence

 1 #include <cctype>
 2 #include <cstdio>
 3 
 4 const int INF=0x3f3f3f3f;
 5 const int MAXN=100010;
 6 
 7 int T,n,s,ans;
 8 
 9 int a[MAXN];
10 
11 inline void read(int&x) {
12     int f=1;register char c=getchar();
13     for(x=0;!isdigit(c);c==‘-‘&&(f=-1),c=getchar());
14     for(;isdigit(c);x=x*10+c-48,c=getchar());
15     x=x*f;
16 }
17 
18 int hh() {
19     read(T);
20     while(T--) {
21         read(n);read(s);
22         int sum=0;
23         ans=INF;
24         for(int i=1;i<=n;++i) read(a[i]),sum+=a[i];
25         if(s>sum) {printf("0\n");continue;}
26         int head=1,tail=1;
27         sum=a[1];
28         while(head<=tail) {
29             if(sum<s&&tail<n) sum+=a[++tail];
30             else sum-=a[head++];
31             if(sum>=s)
32               if(ans>tail-head+1) ans=tail-head+1; 
33         }
34         printf("%d\n",ans);
35     } 
36     return 0;
37 }
38 
39 int sb=hh();
40 int main(int argc,char**argv) {;}