寒假集训_专题一题解_A（POJ 3061）

最新推荐文章于 2022-02-21 18:13:49 发布

m0_46185124

最新推荐文章于 2022-02-21 18:13:49 发布

阅读量175

点赞数

分类专栏：专题训练文章标签： c++ 算法

本文链接：https://blog.csdn.net/m0_46185124/article/details/103962886

版权

专题训练专栏收录该内容

32 篇文章 1 订阅

订阅专栏

题目

Time Limit: 1000MS Memory Limit: 65536K
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，让你再此序列中找到最小的连续子序列（包括自身），使得子序列序列个数最小，且子序列的和大于等于S。

题目分析

典型的双指针（尺取）算法，设置两个指针i、j，计算i为起点，j为终点的子序列的和sum，并检验。不难得出，若sum>=S,则更新答案，并且i加到sum<S时。若sum<S，则j加到sum>=S。

代码

#include <iostream>
using namespace std;
int a[100010];
int main()
{
	int t;
	cin >> t;
	while(t--)
	{
		int n,s,ts = 0,ans = 0x3f3f3f3f;
		scanf("%d%d", &n, &s);
		for(int i = 1; i <= n; i ++)
		scanf("%d",&a[i]);
		ts = a[1];
		for(int i = 1, j = 1;;)
		{
			if(ts >= s)
			{
				ans = min(ans, j - i + 1);
				ts -= a[i];
				i ++;
			}
			else if(j < n)
			{
				j ++;
				ts += a[j];
			}
			else break;
		}
		if(ans != 0x3f3f3f3f)printf("%d\n",ans);
		else printf("0\n");
	}
	return 0;
 }