一花一世界

一树一菩提

2678 - Subsequence

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 

Many test cases will be given. 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 there isn't such a subsequence, print 0 on a line by itself.

Sample Input 

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 <stdio.h>
using namespace std;
const int MAXN = 100010;
int g[MAXN];
int n, m;
int main()
{
    int i, sum, ans, l;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        ans = n+1;
        l = 0;
        sum = 0;
        for(i=0; i<n; i++)
        {
            scanf("%d",&g[i]);
        }
        for(i=0; i<n; i++)
        {
            sum+=g[i];
            while(sum>m)
            {
                ans = min(ans, i-l+1);
                sum -= g[l++];
            }
        }
        if(ans == n+1)ans = 0;
        printf("%d\n",ans);
    }
    return 0;
}


 

 

 

 

阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/fljssj/article/details/46831859
个人分类: 数学找规律
相关热词: 2678算24点
上一篇LA11549 - Calculator Conundrum
下一篇3029 - City Game
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭