poj 3061(高效枚举)

#include <iostream>using namespace std;int b[100005]; int main(){int n,s,i,j,ans,x,t;cin>>t;while(t--){cin>>n>>s;for(i=1;i<=n;i++){cin>>x;b[i]=x+b[i-1];}ans=n+1;for(i=j=1;j<=n;j++){if(b[i-1]>b[j]-s) continue;while(b[i]<=b[j]-s) i++;ans=min(ans,j-i+1);}if(ans==n+1) cout<<0<<endl;else cout<<ans<<endl;}return 0;}