题目:
Max Sum
1000ms 32768K
描述:
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.
输入:
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).
输出:
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.
样例输入:
2 5 6 -1 5 4 -7 7 0 6 -1 1 -6 7 -5
样例输出:
Case 1: 14 1 4 Case 2: 7 1 6
翻译:
描述:
给定一个序列a[1],a[2],a[3]......a[n],你的工作是计算一个子序列的最大和,例如,给出(6,-1,5,4,-7),在这个序列中最大和是6 + (-1) + 5 + 4 = 14.
输入:
输入的第一行包含一个整数 T(1<=T<=20)意思为测试用例的数量,接下来的T行,每一行以一个数N(1<=N<=100000)开头,接下来N个整数(所有的整数在-1000到1000之间)。
输出:
对于每个测试用例,你应该输出两行,第一行是 "Case #:", #意思是每个测试用例的编号,第二行包含三个整数,在序列中最大的和,子序列开始的位置,子序列的终止位置,如果有多个结果,输出第一个,在两个测试用例之间输出一个空行。