最大子列和CT 01-复杂度2 Maximum Subsequence Sum

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≤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

#include <stdio.h>
int MaxSubSum(int a[],int n);
int FirstI,EndI;
int main()
{
    int n,a[10005],MaxSum;
    while(scanf("%d",&n)!=EOF)
    {
        for(int i = 0;i < n;i++)
        scanf("%d",&a[i]);
        MaxSum = MaxSubSum(a,n);
        if(MaxSum != -1)
            printf("%d %d %d
",MaxSum,a[FirstI],a[EndI]);    
        else
            printf("0 %d %d
",a[FirstI],a[EndI]);    
    }
    return 0;
}
int MaxSubSum(int a[],int n)
{
    int ThisSum = 0,MaxSum= -1;
    int firsti=-1;
    FirstI = 0;EndI = n-1;
    for(int i = 0;i < n;i++){
        ThisSum += a[i];
        if(MaxSum < ThisSum){
            MaxSum = ThisSum;
            EndI = i;
            FirstI = firsti + 1;
        }
        else if(ThisSum < 0)
        {
            ThisSum = 0;
            firsti = i;
        }
    }
    return MaxSum;
}

 忘掉以前写过了，又写一遍。。。然而总体思路好像差不多 但是这二次有一项不通过。。。记录下（已改正）上下两个想法一模一样，不愧是亲生的。。。

//并列和对应相同i，不同j，即尾是0   该项不通过 
#include <stdio.h>
int left = 0,right = 0,right_left = 0;
int MaxSubseqSum4(int a[],int size)
{
    int ThisSum = 0,MaxSum = -1;        //MaxSum = -1是为了只有负数和 0时，记录第一个0位置 
     for(int i = 0;i < size;i++){
         ThisSum += a[i];
        if(MaxSum < ThisSum) {
            MaxSum = ThisSum;
            right = i;
            right_left = left;        //因为l之后ThisSum < 0时left会变 把此时right对应的left记录下来 
        }
        else if(ThisSum < 0) {
            ThisSum = 0;
            left = left + 1;　　　　　　//原为left++ 此处出错  left+1为了记录最大子列的第一个的位置
        }　　
    }
    return MaxSum;
}
int main()
{
    int n,a[100005];

    scanf("%d",&n); 
    for(int i = 0;i < n; i++) {
        scanf("%d",&a[i]);
    }
    int MaxSum = MaxSubseqSum4(a,n);
    
    if(MaxSum == -1) {        //全是负数  　　　　　　//原为left == n 上面错了 这里也错了
        printf("0 %d %d
", a[0], a[n-1]);
    } else {
        printf("%d %d %d
", MaxSum, a[right_left], a[right]);
    }
    return 0;
}