Subsequence POJ - 3061 尺取法

最新推荐文章于 2021-08-10 16:08:42 发布

原创最新推荐文章于 2021-08-10 16:08:42 发布 · 191 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

尺取专栏收录该内容

4 篇文章

订阅专栏

本文介绍了一个经典的编程问题：寻找最短连续子序列，其元素之和大于或等于给定值S。通过滑动窗口（尺取）算法实现，提供了一段C++代码示例。

Subsequence

POJ - 3061

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，输出区间长度，没有的话输出0

尺取

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
const int INF = 0x3f3f3f3f;

int a[100007];
int main() {
	
	int t;
	scanf ("%d", &t);
	while (t--) {
		int n, s;
		scanf ("%d %d", &n, &s);
		for (int i = 1; i <= n; ++i) {
			scanf ("%d", &a[i]);
		}
		int ans = INF;
		int head = 0, sum = 0;
		for (int tail = 1; tail <= n; sum -= a[tail++]) {
			while (head < n && sum < s) sum += a[++head];
			if (sum < s) break;
			ans = min(ans, head - tail + 1);
		}
		if (ans != INF)
			printf ("%d\n", ans);
		else puts("0");
	}
	
	return 0;
}