zoukankan      html  css  js  c++  java
  • PAT 甲级 1007 Maximum Subsequence Sum

    https://pintia.cn/problem-sets/994805342720868352/problems/994805514284679168

    Given a sequence of K integers { N1​​, N2​​, ..., NK​​ }. A continuous subsequence is defined to be { Ni​​, Ni+1​​, ..., Nj​​ } where 1. The Maximum Subsequence is the continuous subsequence which has the largest sum of its elements. For example, given sequence { -2, 11, -4, 13, -5, -2 }, its maximum subsequence is { 11, -4, 13 } with the largest sum being 20.

    Now you are supposed to find the largest sum, together with the first and the last numbers of the maximum subsequence.

    Input Specification:

    Each input file contains one test case. Each case occupies two lines. The first line contains a positive integer K (≤). The second line contains K numbers, separated by a space.

    Output Specification:

    For each test case, output in one line the largest sum, together with the first and the last numbers of the maximum subsequence. The numbers must be separated by one space, but there must be no extra space at the end of a line. In case that the maximum subsequence is not unique, output the one with the smallest indices i and j (as shown by the sample case). If all the K numbers are negative, then its maximum sum is defined to be 0, and you are supposed to output the first and the last numbers of the whole sequence.

    Sample Input:

    10
    -10 1 2 3 4 -5 -23 3 7 -21
    

    Sample Output:

    10 1 4

    时间复杂度:$O(n)$

    代码:

    #include <bits/stdc++.h>
    using namespace std;
    
    int a[11111];
    int dp[11111];
    
    int main() {
        int n;
        scanf("%d", &n);
        int ans = 0, temp = 0, cnt = 0, sum = 0;
        for(int i = 1; i <= n; i ++)
            scanf("%d", &a[i]);
        for(int i = 1; i <= n; i ++) {
            if(a[i] < 0)
                sum ++;
        }
        if(sum == n)
            printf("0 %d %d
    ", a[1], a[n]);
        else {
            if(n == 1)
                printf("%d %d %d
    ", a[n], a[n], a[n]);
            else {
                for(int i = 0; i < n; i ++) {
                    dp[i + 1] = max(a[i + 1], a[i + 1] + dp[i]);
                    if(dp[i + 1] > ans) {
                        temp = i + 1;
                        ans = dp[i + 1];
                    }
                }
                for(int i = temp; i >= 1 && dp[i] >= 0; i --) 
                    cnt = i;
                printf("%d %d %d
    ", ans, a[cnt], a[temp]);
            }
        }
        return 0;
    }
    

      

  • 相关阅读:
    L2TP协议
    PPP协议
    centos 更新linux内核
    关于GRUB2
    误删除libc.so.6 恢复
    LVS DR模式 负载均衡服务搭建
    进程地址空间分布和可执行文件分布
    centos 开机启动服务
    【netcore基础】ConcurrentDictionary 使用字符串作为key给代码加锁且使用EF事物防止并发调用数据混乱的问题
    【年终总结】个人的2018年年终总结
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/9655144.html
Copyright © 2011-2022 走看看