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
Java Code:
import java.util.Scanner;
public class Main {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int T=sc.nextInt();
int count=1;
while(T>0){
int n=sc.nextInt();
int[] a=new int[n];
int b=0, c=0;
int max=Integer.MIN_VALUE;
for(int i=0;i<a.length;i++){
a[i]=sc.nextInt();
}
int sum=0;
int k=0;
for(int i=0;i<a.length;i++){
sum+=a[i];
if(sum>max){
max=sum;
b=k;
c=i;
}
if(sum<0){
sum=0;
k=i+1;
}
}
System.out.println("Case "+count+":");
System.out.println(max+" "+(b+1)+" "+(c+1));
count++;
T--;
if(T!=0){
System.out.println();
}
}
}
}