ZOJ3123 Subsequence

 #include <iostream>

using namespace std;

#include<string.h>

int n,s;

int a[100010];

int minl;

int sum;

int main()

{

int i;

int num;

cin>>num;

while(num--){

cin>>n>>s;

        memset(a,0,sizeof(a));

for(i=0;i<n;i++){

cin>>a[i];

}

minl=n;

sum=0;

int current=0,k=0;

for(;k<n || sum>=s;){

if(sum>=s){

sum-=a[current];

current++;

if(k-current+1<minl){

minl=k-current+1;

}

}

else{

sum+=a[k];

k++;

}

}

if(current==0)

cout<<0<<endl;

else

cout<<minl<<endl;

}

return 0;

}