题目:
描述:
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.
翻译如下
描述:
现在有一个序列a[1],a[2],a[3]......a[n],你的任务是计算其子序列的最大和。比如,序列(6,-1,5,4,-7),最大和值是由第一个元素~第四个元素6,-1,5,4相加得到 6 + (-1) + 5 + 4 = 14。
输入:
第一行包含一个整型T(1<=T<=20),表示将会有T个样例。接下来T行,每一行先输入一个整型N(1<=N<=100000),表示接下来将输入N个整型(所有整型均大于-1000小于1000)。
输出:
对于每一个样例,你要输出两行内容。第一行为"Case #:",#表示样例的序数。第二行包含3个整型,分别表示其子序列的最大和,该子序列的起始位置,该子序列的结束位置。如果子序列不止一个,输出第一个子序列的情况即可。每一个样例之间有一个空行将其隔开。