一道关于DP的ACM

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.

 

这题的基本思想是:从头开使累加,当加到第N个时,如果前面N-1个的数的和小于0那么从第N个位置重新开使累加

 

附上我的Java代码

 

public static void main(String args[]) { Scanner input=new Scanner(System.in); int T=input.nextInt(); // The case number of the program int N; //The size of each case int num; // The input number int startP=0;// The start position of the result int endP=0; // The end position of the result for(int i=0;i<T;i++) { N=input.nextInt(); //The size of each case int Max=-9999; //The max result int sum=0; // The temporary total of the number int temp=1; // The temporary start position for(int j=0;j<N;j++) { num=input.nextInt(); // The input number sum+=num; if(sum>Max) { Max=sum; startP=temp;// The start position of the result endP=j+1; //The end position of the result } if(sum<0) { sum=0; temp=j+2; } } System.out.println("Case "+(i+1)+":"); System.out.println(Max+" "+startP+" "+endP); if(i<T-1) System.out.println(); } }