poj Subsequence

最新推荐文章于 2020-01-13 13:32:07 发布

mrcoderrev

最新推荐文章于 2020-01-13 13:32:07 发布

阅读量223

点赞数

分类专栏： Greedy

本文链接：https://blog.csdn.net/yjf3151731373/article/details/51980539

版权

Greedy 专栏收录该内容

16 篇文章 0 订阅

订阅专栏

Subsequence

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 12021		Accepted: 5035

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

#include <iostream>
#include <cstdio>
using namespace std;
const int N =  100010;
int a[N];


int main()
{
    int t;
    scanf("%d", &t);
    while(t--)
    {
        int n, s;
        scanf("%d %d", &n, &s);
        for(int i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
        }
        int res=n+1;
        int l=0, r=0, sum=0;
        for(;;)
        {
            while(r<n&&sum<s)
            {
                sum+=a[r++];
            }
            if(sum<s)
            {
                break;
            }
            res=min(res,r-l);
            sum-=a[l++];
        }
        if(res>n)
        {
            printf("0\n");
        }
        else
        {
            printf("%d\n",res);
        }
    }
    return 0;
}