PAT 甲级 1007. Maximum Subsequence Sum

原题传送门

• 当临时最大和temp < 0，那么后面不管来什么值，都应该舍弃temp < 0前面的内容。舍弃后，直接令temp = 0，并且同时更新left的临时值temp_left。
• 最大子序列中可能存在长度更小、sum相同的最大子序列，这里没有考虑。

#include <iostream>
#include <vector>
using namespace std;

int main(int argc, const char * argv[]) {
    int K;  // 序列长度
    int left = 0, right = 0;    // 记录最大子序列的首尾下标
    int temp_left = 0;  // 记录目前最大子序列的首下标
    int flag = 0;   // 判断序列是否全为负数
    int sum = -1, temp = 0;
    cin >> K;
    vector<int> vec(K);
    for(int i = 0; i < K; ++i) {
        cin >> vec[i];
        if(vec[i] >= 0)
            flag = 1;
        temp = temp + vec[i];
        if(temp > sum) {
            sum = temp;
            left = temp_left;
            right = i;
        } else if(temp < 0) {
            temp = 0;
            temp_left = i + 1;
        }
    }
    if(flag == 0)   // 整个序列都是负数,和记为0
        printf("0 %d %d", vec[0], vec[K-1]);
    else
        printf("%d %d %d", sum, vec[left], vec[right]);

    return 0;
}

附原题：

Given a sequence of K integers { N1, N2, …, NK }. A continuous subsequence is defined to be { Ni, Ni+1, …, Nj } 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