Poj3061 尺取法

Subsequence

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 33132		Accepted: 13783

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

Source

Southeastern Europe 2006

 

   尺取法，即为在线性数组上对某一区间段操作。每次根据情况移动区间起点或区间终点，从而避免在线性空间上的O(N^2)操作。这道题要求大于等于某一数值S，那么我们就按照这个标准在区间上移动，满足这个条件就判断当前长度是不是最小长度，不满足这个条件我们就继续移动区间。

#include<iostream>
#include<stdio.h>
#include<math.h>
using namespace std;

int arr[100000+5];

int main(){
	int casen;
	cin>>casen;
	while(casen--){
		int S,N;
		cin>>N>>S;
		for(int i=0;i<N;i++){
			scanf("%d",&arr[i]);
		}
		int st=0,en=0;
		int now=0; 
		int ans=100000000;
		while(en<N){
			if(now>=S){
				ans=min(ans,en-st);
				now-=arr[st++];
			}else{
				now+=arr[en++];
			}
		}
		
		while(now>=S){
			ans=min(ans,en-st);
			now-=arr[st++];
		}
		cout<<(ans==100000000? 0:ans)<<endl;
	} 
	return 0;
}