POJ-Subsequence(3061)——尺取法求最小和区间

Description

A sequence of N positive integers (10 < N < 100 000), each of them less than or equal 10000, and a positive integer S (S < 100 000 000) are given. Write a program to find the minimal length of the subsequence of consecutive elements of the sequence, the sum of which is greater than or equal to S.

Input

The first line is the number of test cases. For each test case the program has to read the numbers N and S, separated by an interval, from the first line. The numbers of the sequence are given in the second line of the test case, separated by intervals. The input will finish with the end of file.

Output

For each the case the program has to print the result on separate line of the output file.if no answer, print 0.

Sample Input

2
10 15
5 1 3 5 10 7 4 9 2 8
5 11
1 2 3 4 5

Sample Output

2
3

 

题目分析：

• 采用尺取法，这里用num数组表示前n项和，需要用到num[ 0 ]=0，因为num[ n ] - num[ 0 ]不会漏掉第一项。
• num[ a ] - num[ b ]表示取出( b , a ]区间的值。
• 指定两个指针f，e分别表示左指针和右指针，初始化f，e为0。

 

算法描述：

1. 设s为所求区间和，n为区间长度，不断右移e指针直到num[ a ] - num[ b ] >= s。
2. 当num[ a ] - num[ b ] >= s时不断右移f指针，记录e-f的最小值。
3. 当e>n时，循环结束，否则，回到第1步。
4. 输出e-f的最小值。

 

AC代码：

#include <iostream>
#include <algorithm>
using namespace std;
int num[100001];//前n项和 
void solve(int n,int s){
	int f=0,e=0,inp;//左右指针，输入 
	int mmin=0;//默认找不到输出0 
	for(int i=1;i<=n;i++){
		cin>>inp;
		num[i]=num[i-1]+inp;//累加 
	}
	while(e<=n){//循环结束条件 
		while(num[e]-num[f]<s&&e<=n){
			e++;//右指针右移 
		}
		if(e>n) break;//超界退出循环 
		while(num[e]-num[f]>=s){
			if(!mmin) mmin=e-f;//记录最小值 
			else mmin=min(mmin,e-f);
			f++;
			//cout<<f<<' '<<e<<endl;
		}
	}
	cout<<mmin<<endl;//输出 
}
int main(){
	int t;
	cin>>t;//测试样例 
	num[0]=0;
	while(t--){
		int n,s;
		cin>>n>>s;//输入 
		solve(n,s);
	}
	return 0;
}