poj 3061 尺取法

Subsequence

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 12078		Accepted: 5055

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

题目大意： 给你一个正整数序列 让你求不小于s的最小子序列长度。

尺取法

ps：尺取法是需要序列符合单调性的。

反复地推进区间的开头和末尾

，来求满足条件的最小区间的方法称为尺取法。

主要思想为：当a1,  a2  , a3 满足和>=S,得到一个区间长度3，那么去掉开头a1,   剩下 a2,a3，判断是否满足>=S,如果满足，那么区间长度更新，如果不满足，那么尾部向后拓展，判断a2,a3,a4是否满足条件。重复这样的操作。

个人对尺取法的理解：

当一个区间满足条件时，那么去掉区间开头第一个数，得到新区间，判断新区间是否满足条件，如果不

满足条件，那么区间末尾向后扩展，直到满足条件为之，这样就得到了许多满足条件的区间，再根据题

意要求什么，就可以在这些区间中进行选择，比如区间最长，区间最短什么的。这样跑一遍下来，时间

复杂度为O（n)。

代码：
#include <iostream>
#include <cstdio>
using namespace std;
int a[100050];
int main()
{
int t;
cin>>t;
while (t!=0)
{

t--;
int n,s;
cin>>n>>s;
for(int i=1;i<=n;i++)
cin>>a[i];
int sum=0,q=1,e=1,ans=n+1;

for(;;)
{
while(e<=n&&sum<s)
{
sum+=a[e];
e++;
}
if(sum<s)
break;
ans=min(ans,e-q);
sum-=a[q];
q++;
}
if(ans==n+1)
cout<<0<<endl;
else 
cout<<ans<<endl;
}
return 0;
}