zoukankan      html  css  js  c++  java
  • UVA

    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.
    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

    1.非负,和,可以想到累加数组,进一步优化

    2.观察复杂度,都在增加,所以为o(n)

    #include <cstdio>
    #include <algorithm>
    
    using namespace std;
    
    int main() {
        int n, S, A[100000];
        while (scanf("%d%d", &n, &S) == 2) { //注意退出
            int ans = n + 1, j = 0, t = 0;
            for (int i = 0; i < n; ++i)
                scanf("%d", &A[i]);
            for (int i = 0; i < n; ++i) {
                if (i > 0)
                    t -= A[i - 1]; //第i个值开始往后的最小序列
                while (t < S and j < n)
                    t += A[j++];
                if (t >= S)
                    ans = min(ans, j - i);
            }
            printf("%d
    ", ans == n + 1 ? 0 : ans);
        }
    }
  • 相关阅读:
    bzoj2161 布娃娃
    bzoj2161 布娃娃
    Tyvj1054
    Tyvj1054
    Tyvj1053
    Tyvj1053
    hdu3265 Poster(扫描线)
    hdu3265 Poster(扫描线)
    hdu3265(好题翻译)
    hdu3265(好题翻译)
  • 原文地址:https://www.cnblogs.com/wangsong/p/7634961.html
Copyright © 2011-2022 走看看