Subsequence ZOJ:3123

最新推荐文章于 2019-06-30 10:24:39 发布

原创最新推荐文章于 2019-06-30 10:24:39 发布 · 155 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#C++ #ZOJ

数据结构与算法同时被 2 个专栏收录

9 篇文章

订阅专栏

c++

8 篇文章

订阅专栏

博客围绕一个算法问题展开，给定N个正整数序列和正整数S，需用C++编写程序找出连续元素子序列的最小长度，使其和大于或等于S。还给出了输入输出格式及样例。

Subsequence

Time Limit: 1 Second Memory Limit: 32768 KB

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

#include<bits/stdc++.h>
using namespace std;
int main() {
	int m;
	cin >> m;
	while (m--) {
		int n, s, sum(0), min(0);
		queue<int>q;
		cin >> n >> s;
		for (size_t i = 0; i < n; i++)
		{
			int temp;
			cin >> temp;
			sum += temp;
			q.push(temp);
			while (sum - q.front() > s)
			{
				sum -= q.front();
				q.pop();
			}
			if (sum >= s && (min > q.size() || min == 0)) {
				min = q.size();
			}
		}
		cout << min << endl;
	}
	//system("pause");
	return 0;
}