今天碰到一道要使用尺取法的题目,今天也是我第一次学习到什么是尺取法。。。。
看题吧:
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.
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.
For each the case the program has to print the result on separate line of the output file.if no answer, print 0.
2 10 15 5 1 3 5 10 7 4 9 2 8 5 11 1 2 3 4 5
2 3
题意:给定一个序列,找出最短的子序列长度,使得其和大于或等于S。
题目大意是要从一堆连续的数中找出和为S的最小需要的数,例如:
(1)5 + 10 = 15>=15(S)
(2)3 + 4 + 5 = 12>11(S)
第一个例子结果是2个数字,第二个例子是三个数字;
上代码:
#include<iostream>
using namespace std;
int a[1000000];
int main()
{
int m, n, s;
cin >> m;
while (m--){
cin >> n >> s;
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
int st = 0, en = 0;
int ans = n; int sum = 0;
while (1){
while (en<n && sum<s) sum += a[en++];
if (sum < s) break; //说明此时所有的数加起来还是小于s
ans = min(ans, en-st); //找出最小的能加起来和为s的数字的个数
sum -= a[st++]; //去掉首位元素,方便比较
}
if (ans == n) ans = 0;
cout << ans << endl;
}
return 0;
}
分析:首先,序列都是正数,如果一个区间其和大于等于S了,那么不需要在向后推进右端点了,因为其和也肯定大于等于S但长度更长,所以,当区间和小于S时右端点向右移动,和大于等于S时,左端点向右移动以进一步找到最短的区间,如果右端点移动到区间末尾其和还不大于等于S。
引用博客:http://blog.csdn.net/consciousman/article/details/52348439(尺取法的用法)