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.
Sample Input:
10
-10 1 2 3 4 -5 -23 3 7 -21
Sample Output:
10 1 4
#include<iostream>
using namespace std;
int main()
{
int K;
cin >> K;
int nums[K];
int fuCount = 0;
for(int i = 0; i < K; i++)
{
cin >> nums[i];
if(nums[i] < 0)
fuCount++;
}
//如果输入的数据全部为负数,则可以直接输出答案
if(fuCount == K)
{
cout << "0 " << nums[0] << " " << nums[K - 1];
return 0;
}
//step为步长,在有新的最大和出现时,记录最后一个数据的位置,根据步长推算起始位置
//在连续子数列和重置为0的时候,步长置为0,重新计数
int first = 0, last = 0, step = 0;
int maxSum = 0xc0c0c0c0, thisSum = 0;
for(int i = 0; i < K; i++)
{
thisSum += nums[i];
step++;
if(thisSum > maxSum)
{
maxSum = thisSum;
last = i;
first = last - step + 1;
}
if(thisSum < 0)
{
thisSum = 0;
step = 0;
}
}
cout << maxSum << " " << nums[first] << " " << nums[last];
return 0;
}