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 <cstdio>
#include <climits>
using namespace std;
int in[10001];
int dp[10001];
int maxsum; // 记录最大子序列和
int minstart; // 记录当前最大子序列和的最小起始位置
int minend; // 记录当前最大子序列和的最小结束位置
int main()
{
int k;
scanf("%d", &k);
bool allNegative = true;
for(int i = 0; i < k; i++)
{
scanf("%d", in + i);
if(in[i] >= 0)
allNegative = false;
}
if(allNegative) // 所有数都是负数
{
printf("0 %d %d", in[0], in[k - 1]);
return 0;
}
maxsum = dp[0] = in[0];
int start = 0; // 记录当前子序列的起始位置
minend = minstart = 0;
for(int i = 1; i < k; i++)
{
if(dp[i - 1] >= 0)
dp[i] = dp[i - 1] + in[i];
else
{
start = i; // 更新当前子序列的起始位置
dp[i] = in[i];
}
if(dp[i] > maxsum)
{
minstart = start;
minend = i;
maxsum = dp[i];
}
}
printf("%d %d %d", maxsum, in[minstart], in[minend]);
return 0;
}