Problem C
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 89 Accepted Submission(s) : 16
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
Problem Description
Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.
Input
The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line starts with a number N(1<=N<=100000), then N integers followed(all the integers are between -1000 and 1000).
Output
For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. If there are more than one result, output the first one. Output a blank line between two cases.
Sample Input
2 5 6 -1 5 4 -7 7 0 6 -1 1 -6 7 -5
Sample Output
Case 1: 14 1 4 Case 2: 7 1 6
思路分析:
从第一个正值开始计算和,储存最大和到max并标记首尾;遇到总和为负数则结束此次动态规划,从下一个正值继续。
代码实现:
#include <stdio.h>
int main()
{
int i, j, N, n, sum, start, end, max, tmp, tstart;
scanf("%d",&N);
for (i = 1;i <= N;i ++) {
scanf("%d",&n);
sum = 0;
tstart = 1;
max = -10000;
for (j = 1;j <= n;j ++) {
scanf("%d",&tmp);
sum += tmp;
if (sum > max) {
start = tstart;
end = j;
max = sum;
}
if (sum < 0) {
sum = 0;
tstart = j + 1;
}
}
printf("Case %d:\n%d %d %d\n",i, max, start, end);
if (i != N ) printf("\n");
}
}