Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 304905 Accepted Submission(s): 72445 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 |
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int T = sc.nextInt();
for (int i = 1; i <= T; i++) {
int n = sc.nextInt();
int[] arr = new int[n];
for (int j = 0; j < n; j++) {
arr[j] = sc.nextInt();
}
int max = Integer.MIN_VALUE;
int sum = 0;
int left = 0;
int right = 0;
int temp = 0;
for (int j = 0; j < n; j++) {
sum += arr[j];
if(max < sum) {
max = sum;
left = temp;
right = j;
}
if(sum < 0) {
sum = 0;
temp = j + 1;
}
}
if(max < 0) {
for (int j = 0; j < n; j++) {
if(max == arr[j]) {
left = j;
right = j;
break;
}
}
}
System.out.println("Case " + i + ":");
System.out.println(max + " " + (left + 1) + " " + (right + 1));
if(i != T) {
System.out.println("");
}
}
}
}