简单尺取

题目：
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.

大意为：给出了N个正整数（10 <N <100 000）的序列，每个正整数均小于或等于10000，并给出了一个正整数S（S <100 000 000）。编写程序以查找序列中连续元素的子序列的最小长度，其总和大于或等于S。

题解：这是一道标准的尺取题，我们先用一个数组存这个序列，再用first和last两个变量都指向数组第一个元素，再让last像后移并将fisrt与last之间的数相加并记录，直到大于或等于S。这时记录下，两变量之间的元素的数量，再将first加一，如果还是大于S，first就继续加一，否则last继续右移。这样便一一访问了所有符合题意的连续的数了。最后求出最小的即可。
代码如下：

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>

using namespace std;

int a[101000];

int main()
{
	int F,n,s;
	cin>>F;
	for(int k=0;k<F;k++)
	{
		cin>>n>>s;
		int first=0,last=0,sum=0,num=0;
		for(int i=0;i<n;i++) cin>>a[i];
		for(;last<n;last++)
		{
			sum+=a[last];
			if(sum>=s) break;
		}
		if(sum<s) cout<<"0"<<endl;
		else
		{
			num=last-first+1;	
			while(first<n)
			{
				sum-=a[first];
				first++;
				while(sum<s&&last+1<n) sum+=a[++last];
				if(sum>=s) num=min(num,last-first+1);
			}
			cout<<num<<endl;
		}
	}
	return 0;
}