HDU1003 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     Author Ignatius.L     Recommend We have carefully selected several similar problems for you:  1176 1087 1069 2084 1058

 

题意： 求一个序列的最大连续子序列的和及第一个满足条件的子序列的区间

思路：只要前i项的子序列和还没有小于0就一直往后扩展，否则丢弃之前的子序列开始新的子序列

代码： 

import java.util.Scanner;

public class main4 {
    public static void main(String[] args) {
		 Scanner scan=new Scanner(System.in);
		 int t=scan.nextInt();
		 for(int i=1;i<=t;i++){
			 int n=scan.nextInt();
			 int a[]=new int[n+1];
			 for(int j=1;j<=n;j++){
				 a[j]=scan.nextInt();
			 }
			 int max=-2147483647,sum=0;
			 int l=0,r=0,k=1;
			 for(int j=1;j<=n;j++){
				 sum+=a[j];
				 if(sum>max){
					 max=sum;
					 l=k;
					 r=j;
				 }
				 if(sum<0){
					 sum=0;
					 k=j+1;
				 }
			 }
			 System.out.println("Case "+i+":");
			 System.out.println(max+" "+l+" "+r);
			 if(i!=t) System.out.println();
		 }
	}
}