1. 程式人生 > >(尺取法)poj3061 Subsequence

(尺取法)poj3061 Subsequence

#include<iostream>
#include<cstdio>
using namespace std;
const int maxn=1e5+10;
int n,S;
int a[maxn];

void solve(){
	int res=n+1;
	int s=0,t=0,sum=0;
	for(;;){
		while(t<n&&sum<S){
			sum+=a[t++];
		}
		if(sum<S) break;
		res=min(res,t-s);
		sum-=a[s++];
	}
	if(res>n) res=0;
	printf("%d\n",res);
}

int main(){
	int t;
	scanf("%d",&t);
	while(t--){
		scanf("%d%d",&n,&S);
		for(int i=0;i<n;i++)
			scanf("%d",&a[i]);
		solve();
	}
	return 0;
}