poj3061 尺取法 <挑战程序设计竞赛>

#include<iostream>
#include<cstdio>
using namespace std;

const int N = 100000;
int x[N+1];
int t,n,s;

void res(){
int now=x[1],j=2,mn=N;
for (int i=1;i<=n;i++){
now-=x[i-1];
while (now<s&&j<=n){
now+=x[j++];
}
if (now<s) break;
mn=min(mn,j-i);
}
cout<<mn<<endl;
}

int main(){
while (cin>>t){
while (t--){
int ss=0;
cin>>n>>s;
for (int i=1;i<=n;i++){
scanf ("%d",&x[i]);
ss+=x[i];
}
if (ss<s){
cout<<0<<endl;
}else{
res();
}
}
}
return 0;
}