最大子序列和 Java 实现

1. 问题描述

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

2. 解题思路

改正

①: 可以使用数据第一个数据初始化最大和（毕竟万一输入数据最大子序列和比-99999小呢）  

3. 实现代码:

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        for(int i = 1; i <= n; i++){
            int len = scanner.nextInt();
            int[] arr = new int[len + 1];
            for(int j = 1; j <= len; j ++){
                arr[j] = scanner.nextInt();
            }
            int maxSum = arr[1];
            int temp = 0;
            int start = 1;
            int end = 1;
            int index = 1;
            for(int j = 1; j <= len; j ++){
                temp += arr[j];
                if (temp > maxSum){
                    maxSum = temp;
                    start = index;
                    end = j;
                }
                if (temp < 0){
                    temp = 0;
                    index = j + 1;
                }
            }
            System.out.println("Case "+i+":");
            System.out.println(maxSum+" "+start+" "+end);
            if (i != n) {
                System.out.println();
            }
        }
        scanner.close();
    }
}