哪位大神 能给解释下题意

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

问题描述：给定一个序列，让你求这个序列中的一个子序列，使得该子序列中元素的和是所有子序列中最大的
输入：第一行输入共有几个测试序列（T个），余下T行分别输入这T个测试序列中元素的个数N及这N个元素的值
输出：对于每个测试序列，其输出包含两行，第一行Case #,"#"表示序列的序号，第二行的输出包含三项，第一项是所求子序列的元素的和的值，第二项是该子序列在原序列中的起始位置，第三项是该子序列在原序列中结束位置。
大概就是这个意思吧，不知道我说清楚没有。

看见英文就头疼

英语是什么。好吃吗？

最大整数和序列。

瞄一眼就知道什么了吧。