1007 Maximum Subsequence Sum (25 point(s))
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
题目大意:
计算最大子列和,并记录相应头尾元素,输出的头尾元素需要索引最小;若全为负数,输出首位元素
设计思路:
动态规划
- 函数 f(i) 表示以第 i 个数结尾的子数列的最大和,则:
- 当 i = 0 或 f(i - 1) < 0 时,f(i) = data[i];
- 当 i != 0 且 f(i - 1) >= 0 时,f(i) = f(i - 1) + data[i];
注:输出头元素索引最小,则之前子列和为 0 的子列需要包含进来;输出尾元素索引最小,则之后子列和为 0 的子列不需要包含进来
编译器:C (gcc)
#include <stdio.h>
int main(void)
{
int k;
int m, first;
int tempstart, tempend, tempsum = -1;
int start = -1, end, sum = 0;
int i;
scanf("%d", &k);
for (i = 0; i < k;i++) {
scanf("%d", &m);
if (i == 0)
first = m;
if (tempsum < 0) {
tempstart = m;
tempsum = 0;
}
tempsum += m;
if (tempsum >= 0)
tempend = m;
if (tempsum > sum || (!tempsum && !sum)) {
start = tempstart;
end = tempend;
sum = tempsum;
}
}
if (start == -1)
printf("0 %d %d", first, m);
else
printf("%d %d %d", sum, start, end);
return 0;
}