01-复杂度2 Maximum Subsequence Sum(输出开头结尾的最大子列和问题)

#include<stdio.h>
int main()
{
	int K,SUM,sumnow,num[10001];
	int start,end;//用于记录最大子列的初末值 
	int eye = 1;
	scanf("%d",&K);
	
	SUM = 0;   
	sumnow = 0;
	for(int i=0;i<K;i++){
		scanf("%d",&num[i]);
		if(num[i]==0)
			eye = 0;//将0，负数组合与全负数区分(这两种情况都会导致SUM是0) 
		sumnow += num[i];
		if(sumnow>SUM||sumnow==SUM&&sumnow==0){   //这个||后面的情况是专门为0与负数组合设置的 
			SUM = sumnow;
			end = i;
		}
		if(sumnow<SUM&&sumnow<0)
			sumnow = 0;
	}//正向读入并找到子列和结尾数字，原理和只要求SUM的子列和问题一致由于在线处理法无法 
	  //由于在线处理法无法得到最大子列和开始值，所以下面逆着把所有数跑一遍，逆序的结尾就是正序的开始 
	  
	SUM = 0; 
	sumnow = 0;
	for(int i=K-1;i>=0;i--){
		sumnow += num[i];
		if(sumnow>=SUM){
			SUM = sumnow;
			start = i;
		}
		if(sumnow<SUM&&sumnow<0)
			sumnow = 0;
	}//将数组反着跑一遍，找到最大子列和开始数字 
		
	if(eye&&SUM==0){
		start = 0;
		end = K-1;	
	}//全为负数，则按题目要求输出所有数字第一个和最后一个值 
	
	printf("%d %d %d",SUM,num[start],num[end]);
	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.（如果序列所有数都是负数，则输出最大子列和应为零，并输出序列的第一个和最后一个数字）

上面这一段是容易忽视的，一开始以为是直接输出负数序列的最大子列和（即最小负数），提交无数次不通过后，才发现题干有这么个要求...