PAT-A-1007 Maximum Subsequence Sum (25分) C/C++实现（动态规划）

Given a sequence of K integers { N₁ , N₂ , … ,N_k }. A continuous subsequence is defined to be { N_i , N_{i + 1} , … ,N_j } where 1 ≤ i ≤ j ≤ 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 (≤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

• 题目大意：
  给出一个含有k个整数的序列，找出和最大的子序列，输出最大和，子序列的第一个元素和最后一个元素；若子序列不唯一，则选择更靠左子序列；如果所有的数均为负数，则认为最大和为0，输出原序列的首尾元素；
• 思路：
  1. 读入整数序列存储在数组num中，temp_sum为当前子序列的和，temp_left 为当前子序列的左下标；max_sum用来记录到目前为止所找到的最大子序列之和，left，right为其左右下标；
  2. 遍历原整数序列， temp_sum += num[i], 如果此时temp_sum < 0, 则舍弃该子序列，因为负数对总体的贡献为负，且令temp_left = i + 1（重新开始一个子序列）；
  3. 如果此时temp_sum >= 0, 该子序列应该保留下来，并且与已知的max_sum作比较， 若temp_sum > max_sum, 则更新max_sum, left, right；

#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
    int n;
    cin >> n;
    int left, right, max_sum = -1, temp_sum = 0, temp_left = 0;
    int num[10000];
    for (int i = 0; i < n; i++)
    {
        cin >> num[i];
        temp_sum += num[i];
        if (temp_sum < 0)
        {
            temp_sum = 0;
            temp_left = i + 1;
        }
        else if (temp_sum > max_sum)
        {
            max_sum = temp_sum;
            left = temp_left;
            right = i;
        }   
    }
    if (max_sum < 0)
    {
        cout <<  "0" << " " << num[0] << " " << num[n - 1];
    }
    else
    {
        cout << max_sum << " " << num[left] << " " << num[right];
    }
    return 0;
}