1007 Maximum Subsequence Sum

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.

可以理解为部分和最大，就是要最大，那么就要最小，最大。

输入：

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.

输出：

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.

需要注意的是全为负数时，最大和要设置为0，且输出第一个数和最后一个数。

还要注意要最小的 i 和 j

#include<iostream>
using namespace std;

int main(){
	int K,i,a[10001],sum[10001],first=0,end,fir1,last1,Sum=-1;
	cin>>K;
	sum[0]=0;
	for(i=1;i<=K;i++)cin>>a[i];
	for(i=1;i<=K;i++)sum[i]=sum[i-1]+a[i];
	for(end=1;end<=K;end++){
        //找到最小的和
		if(sum[end]-sum[first]>Sum){
		Sum=sum[end]-sum[first];
		fir1=a[first+1];//将该数值储存
		last1=a[end];
		}
		if(sum[first]>sum[end])first=end;
        //我们需要前最小，后最大，所以当前比后大的时候就要更新数值
	}
	if(Sum<0)cout<<0<<' '<<a[1]<<' '<<a[K];//根据题意，全为负数时和设置为0
	else cout<<Sum<<' '<<fir1<<' '<<last1;
}