01-复杂度2 Maximum Subsequence Sum

Given a sequence of $K$ integers { N_1N​1​​, N_2N​2​​, ..., N_KN​K​​ }. A continuous subsequence is defined to be { N_iN​i​​, N_{i+1}N​i+1​​, ..., N_jN​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

#include <iostream>using namespace std;int main(){int K;cin>>K;int list[K];for(int i = 0; i < K; i++){cin>>list[i];}int tmpMax = 0, max = -1;int first = -1, last = -1;for(int i = 0; i < K; i++){tmpMax = 0;for(int j = i; j < K; j++){tmpMax += list[j]; if( tmpMax > max){max = tmpMax;first = i;last = j;}}}if(first == -1){cout<<0<<" "<<list[0]<<" "<<list[K-1];}else{cout<<max<<" "<<list[first]<<" "<<list[last];}return 0;}