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 Knumbers, 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 <iostream>
using namespace std;
int sub[10001];
void SubSum(int n)
{
int sum = 0, subMax = -1; //subMax设为-1,保证了最大为0的时候也可以记录下开始点和结束点
int subStart, subEnd, start = 0;
for(int i = 0; i < n; i++){
sum += sub[i]; //依次向右累加
if(subMax < sum){ //更新subMax
subMax = sum;
subStart = sub[start]; //记录下开始的值
subEnd = sub[i]; //以当前位置作为end点
}
if(sum < 0){ //和为负数,累赘
sum = 0; //丢弃之前的sum
start = i+1; //以下一个位置作为新的开始
}
}
if(subMax >= 0)
cout << subMax << ' ' << subStart << ' ' << subEnd;
else //所有子序和为负数,则输出0,最开始的和最后的值
cout << 0 << ' ' << sub[0] << ' ' << sub[n-1];
}
int main()
{
int n;
cin >> n;
for(int i = 0; i < n; i++)
cin >> sub[i];
SubSum(n);
return 0;
}