1007. Maximum Subsequence Sum

Tips:

• 这题真心是郁闷要死了.自己没有看太清题目,加上题目给的实例又比较特殊,我一直以为后面是输出最大序列的左右两个下标,结果一直只对两个点.后来网上查了下别人的blog再仔细对了下题目,才发现自己理解错误.
• 本题注意的点:(1)数列全为负数输出第一位和最后一位.(2)如果数列最大为0,则输出0 0 0即可.(3)如果数列最大子数列最左项和最右项不能为0.
• 本题一次循环即可得出结果.边输入边用max2加上刚输入的数,并用max1保存最大的max1,并记录下最左和最右的数.

#include <stdio.h>

int main(){
    int k,i,j,max1,max2,index,num,left1,right1,left2,right2,first,flag;
    while((scanf("%d",&k) != EOF)){
        max1 = 0;
        max2 = 0;
        flag = 0;
        left1 = -1;
        i = j = -1;
        for(index = 0;index < k;index++){
            scanf("%d",&num);
            if(index == 0)
                first = num;
            if(num >= 0)
                flag = 1;
            max2 += num;
            if(max2 <= 0){
                max2 = 0;
                i = j = -1;
            }else{
                if(i == -1){
                    i = j = 1;
                    left2 = right2 = num;
                }
                else{
                    j = 1;
                    right2 = num;
                }
                if(max2 > max1){
                    max1 = max2;
                    left1 = left2;
                    right1 = right2;
                }
            }
        }
        if(flag == 0){
            left1 = first;
            right1 = num;
        }else{
            if(left1 == -1)
                left1 = right1 = 0;
        }
        printf("%d %d %d\n",max1,left1,right1);
    }
    return 0;
}