Subsequence
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
题意:T个样例,每个样例第一行元素个数n,最大值s,第二行n个元素。从n个元素中找一个连续子序列,它的元素和>=s,且长度最小,输出这个长度
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<queue>
#include<algorithm>
#include<stack>
#include<vector>
using namespace std;
int main()
{
int t;
scanf("%d", &t);
while(t--)
{
int n, s, a[100005]={0};
scanf("%d%d", &n, &s);
for(int i=0; i<n; i++)
scanf("%d", &a[i]);
int l=0, r=0, sum=0, ans=1e5;//l,r模拟尺子范围
while(r<n)
{
sum+=a[r++];//累加和
if(sum>=s)
{
while(sum-a[l]>=s)
{
sum-=a[l++];
}
if(r-l<ans)//更新最优解
ans=r-l;
}
}
if(sum<s)
printf("0\n");
else
printf("%d\n", ans);
}
return 0;
}