1007 Maximum Subsequence Sum (25 分)

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

求最大连续子列长度：可以有一重二重和三重循环，但是感觉用DP会比较复杂(必须考虑中间的部分)

三重: 外循环i从0到N, 中间j从i到N, 里面从i到j求和，最后一个超时

二重：外循环从0到N，内循环从i到N, 循环过来的时候直接求和，可以过

一重：从0到N, 如果求和是负数，那么舍弃掉前面的。如果求和大于当前最大值，那么记录下后面的。

另外一个注意点是：如果全是负的，此时要求输出0. 如果有一个正数或者0，那么一定输出该正数。所以根据求和结果是不是小于0可以看出是否全部是正数。

二重：

#include<iostream>
using namespace std;
int K[10001];
int main(){
    int N;
    cin>>N;
    for(int i=0;i<N;i++){
        cin>>K[i];
    }
    int max=-0xffffff;
    int i,j;
    for(int left=0;left<N;left++){
        int sum=0;    
        for(int right=left;right<N;right++){
            sum+=K[right];
            if(sum>max){
                i=K[left];
                j=K[right];
                max=sum;
            }
        }
    }
    if(max<0){
        i=K[0];
        j=K[N-1];
        max=0;
    }
    cout<<max<<" "<<i<<" "<<j;
}