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.
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
以下为题解:过了是过了,但感觉可能会超时,因为考虑最复杂的情况,while(n--)循环100000次,while(sum>=s)循环100000次
//因为子序列是连续的,故想到了队列
#include<stdio.h>
#include<queue>
#include<algorithm>
using namespace std;
queue<int > que;
int main()
{
int t,n,s,sum,cout,a,end;
while(~scanf("%d",&t))
{
while(t--)
{
while(!que.empty()) que.pop(); //清空队列
cout=sum=0; //cout当时序列长度 sum为总和
end=100001; //end最小序列长度
scanf("%d%d",&n,&s);
while(n--) //一共有n个数,故至少需要输入n次
{
scanf("%d",&a);
que.push(a);
sum+=a;
cout++;
while(sum>=s) //满足条件
{
if(cout<end) end=cout;
sum-=que.front(); //减最早入列的
que.pop();
cout--;
}
}
if(end==100001) printf("0\n");
else printf("%d\n",end);
}
}
return 0;
}