一、内容
Max Sum
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
二、思路
- 求最大连续子序列,记得保存下标即可
- 注意最后一个case后面不要有换行。
三、代码
import java.util.Scanner;
public class HDU_1003 {
static int n, T, a, b, cnt, temA;
static long ans, sum;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
T = sc.nextInt();
while (T-- > 0) {
n = sc.nextInt();
ans = Integer.MIN_VALUE;
sum = 0;
a = b = temA = 1;
int tem;
for (int i = 1; i <= n; i++) {
tem = sc.nextInt();
sum += tem;
if (ans < sum) {
a = temA;
b = i;
ans = sum;
}
if (sum < 0) {
sum = 0;
temA = i + 1;
}
}
System.out.println("Case " + ++cnt + ":");
System.out.println(ans + " " + a + " " + b);
if (T != 0) System.out.println();
}
}
}