https://acs.jxnu.edu.cn/problem/HDU1003
https://acs.jxnu.edu.cn/problem/HDU1003
描述：
Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence.
(给你一个序列a[1],a[2],a[3]......a[n]，你的任务是计算子序列的最大和)
For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.（例如，给你一个(6,-1,5,4,-7)，最大的序列和是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. （第一行输入包含一个整数T(1<=T<=20)T是测试案例组数）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).（然后接下来有T行，每一行开始包括一个数N(1<=N<=100000)，然后接下来N个整数（所有的整数都在-1000到1000之间））
输出：
For each test case, you should output two lines.（对于每一个测试案例，你应该输出两行） The first line is "Case #:", # means the number of the test case. （第一行是“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.（如果有超过一个结果，输出第一个。输出一个空行在两个案例之间）