PTA甲级 1007 Maximum Subsequence Sum (C++)

Given a sequence of $K$ integers $N_1,N_2,...,N_K$. A continuous subsequence is defined to be $N_i,N_{i+1},...,N_j$ where $1\le i\le j\le K$. 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(\le 10000)$. 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

Caution:

这个题有两个值得注意的点，很容易被坑到：

• 要输出的后两个数是nums[i]和nums[j]而不是i和j，题目中的 Sample 刚好上面两个是一样的，所以很容易被迷惑，我一开始就是这一点弄错了导致只有最后一个测试点过了，其他都不正确；
• 题意有一点描述的有问题，这一点还是受到这篇文章的启发，才知道题中描述的“如果数组全是负数则输出0 0 n-1”是不对的，应该是“如果算出来最大的和是负数的话输出 0 0 n-1”。

Solution:

// Talk is cheap, show me the code
// Created by Misdirection 2021-08-10 11:53:43
// All rights reserved.

#include <iostream>
#include <vector>

using namespace std;

int main(){
    int n;
    cin >> n;
    
    vector<int> nums(n);

    for(int i = 0; i < n; ++i) cin >> nums[i];

    int maxSum = nums[0], pos1 = 0, pos2 = 0;

    vector<vector<int>> dp(n, vector<int>(2, 0));

    dp[0][0] = nums[0];
    dp[0][1] = 0;

    for(int i = 1; i < n; ++i){

        if(dp[i - 1][0] + nums[i] >= nums[i]){
            dp[i][0] = dp[i - 1][0] + nums[i];
            dp[i][1] = dp[i - 1][1];
        }
        else{
            dp[i][0] = nums[i];
            dp[i][1] = i;
        }

        if(dp[i][0] > maxSum){
            maxSum = dp[i][0];
            pos1 = dp[i][1];
            pos2 = i;
        }
    }
    
    if(maxSum < 0){
        pos1 = 0;
        pos2 = n - 1;
        maxSum = 0;
    }
    
    cout << maxSum << ' ' << nums[pos1] << ' ' << nums[pos2] << endl;

    return 0;
}