zoukankan      html  css  js  c++  java
  • Subsequence

    Subsequence
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 30334   Accepted: 12752

    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 <cstdio>
    #include <algorithm>
    #include <cstring>
    #define MAX 100005
    #define LL long long
    #define INF 0x3f3f3f3f
    
    using namespace std;
    LL a[100010];
    int n, t, ans = INF;
    LL sum, s;
    
    int main()
    {
        scanf("%d", &t);
        while (t--){
            scanf("%d %I64d", &n, &s);
            for (int i = 0; i < n; i++) scanf("%I64d", a+i);
            int st = 0, en = 0;
            ans = INF; sum = 0;
            while (1){
                while (en<n && sum<s) sum += a[en++];
                if (sum < s) break;
                ans = min(ans, en-st);
                sum -= a[st++];
            }
            if (ans == INF) ans = 0;
            printf("%d
    ", ans);
        }
        return 0;
    }
  • 相关阅读:
    排序算法合集(冒泡,选择,插入,堆排,快排)
    codeforces 632+ E. Thief in a Shop
    nyoj-一笔画问题-欧拉图+联通判定
    hdu-1179-二分图最大匹配
    hdu-2063-二分图最大匹配
    (转)二分图的最大匹配、完美匹配和匈牙利算法
    hdu-2444-二分图判定+最大分配
    C
    E
    C
  • 原文地址:https://www.cnblogs.com/dealer/p/12653704.html
Copyright © 2011-2022 走看看