Max Sum

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

 

AC代码：

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();   //输入测试次数
        int temp = 1;
        int startIndex = 1;     //开始位置
        int endIndex = 1;        //结束位置
        int sum = 0;            //和
        //设置max为最小负数
        int max = -0xfffffff;
        for (int i = 0; i < n; i++) {
            int m = sc.nextInt();     //输入数的个数
            for (int j = 0; j < m; j++) {
                sum += sc.nextInt();
                if (sum > max) {   //当输入的所有数之后就是最大值时
                    max = sum;
                    startIndex = temp;
                    endIndex = j + 1;
                }
                //这里不能用else if 因为当输入的数包含负数和零时，只会执行上面的if
                if (sum < 0) {
                    sum = 0;
                    temp = j + 2;
                }
            }
            System.out.println("Case " + (i + 1) + ":");
            System.out.println(max + " " + startIndex + " " + endIndex);

            sum = 0;   
            max = -0xfffffff;
            startIndex = 1;
            endIndex = 1;
            temp = 1;
            if (i != n - 1) {
                System.out.println();
            }
        }
    }
}