1007 Maximum Subsequence Sum (25 分)
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<algorithm>
#include<string>
#include<cstring>
#include<string.h>
#include<cmath>
#include<map>
#include<vector>
#include<queue>
#include<stack>
#include<set>
#include<iostream>
using namespace std;
const int max_n = 10006;
const int INF = 0x3fffffff;
int du[max_n];
int dp[max_n];
int pre[max_n];
int main()
{
int N;
scanf("%d", &N);
bool negative = true;
for (int i = 0; i < N; i++)
{
scanf("%d", &du[i]);
if (du[i] >= 0)negative = false;//input:2 -1 0 output:0 0 0
}
if (negative)
{
printf("0 %d %d", du[0], du[N - 1]);
return 0;
}
dp[0] = du[0];
pre[0] = 0;
for (int i = 1; i < N; i++)
{
if (dp[i - 1] + du[i] > du[i])
{
dp[i] = dp[i - 1] + du[i];
pre[i] = pre[i - 1];
}
else
{
dp[i] = du[i];
pre[i] = i;
}
}
int k = 0;
for (int i = 0; i < N; i++)
{
if (dp[i] > dp[k])k = i;
}
printf("%d %d %d", dp[k],du[pre[k]],du[k]);
return 0;
}
总结
测试点5的问题在代码中已经注释出来了,当输入为:2 -1 0时,应该输出0 0 0.原因就是当所有数是negative即是所有数都<0时,才需要走negative分支。如果因为这个小问题而丢掉三分我觉得是十分可惜的。