Max sum Time Limit: 2000 ms memory limit: 32768 k any questions? Click Here ^_^ Question 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. enter 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
25 6 -1 5 4 -77 0 6 -1 1 -6 7 -5
Sample output
Case 1:14 1 4Case 2:7 1 6
Prompt
Hdoj1003 note: the background test data volume of this question is large. Use the C language scanf input. Avoid Timeout !!!!
It is also a very classic DP, the meaning is to let the maximum continuous field and it is not difficult to write the state transition equation DP [I] = max (DP [I-1] + I, I );
