动态规划--求最大连续子串之和

package com.example;

public class 最大连续子串之和 {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] a = {-4, 11, -2, 13, -7,- 3, 12} ;
getMaxSumSeq(a);
}

private static void getMaxSumSeq(int[] a){
int rmax = Integer.MIN_VALUE;
int sum = Integer.MIN_VALUE;
int start = -1;
int end = -1;
int temp = -1;
for(int i = 0 ;i<a.length;i++)
{
if(sum>0)
{
sum+=a[i];
}
else
{
sum = a[i];
temp = i;
}
if(sum>rmax)
{
start = temp;
rmax= sum;
end = i;
}
}
for(int j = start;j<=end;j++)
{
System.out.print(a[j]+" ");
}
System.out.println("\nsum:"+rmax);
}
}