poj3061 Subsequence（尺取法）

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

给出一个序列,求区间和大于或者等于S的最短区间长度.

尺取法，就是先找到一个满足的范围，然后r不动，l依次左移，如果移动的过程中依旧满足条件，则r不动。如果条件不满足，则r也移动。移动过程中记录范围最小值。

#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#include<cmath>
#include<iostream>
#include<vector>
#include<set>
#include<stack>
#include<map>
#include<queue>
typedef long long ll;
using namespace std;
int a[100005];
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,s;
        cin>>n>>s;
        for(int i=0;i<n;i++)
        {
            cin>>a[i];
        }
        int l=0,r=0,sum=0,ans=n+1;
        while(1)
        {
            while(r<n&&sum<s)
            {
                sum+=a[r++];
            }
            if(sum<s)
                break;
            ans=min(ans,r-l);
            sum-=a[l++];
        }
        if(ans>n)
            ans=0;
        cout<<ans<<endl;
    }
  return 0;
}