一维数组的最大子数组和

package dp2014;


import java.util.Vector;


/**
 * 求最大子序列和，又称最大字段和
 * 分一维、二维、三维、连通
 * @author leehui
 *
 */
public class MaxSubArray {


/**
* 最简单的情况是一维  dp[i]=max{dp[i-1]+a[i],a[i]}
*/
int []array;
int []dp;
//Data []data;
int []flag;
public MaxSubArray(int []array)
{
this.array=array;
this.dp=new int[array.length];
        this.flag=new int[array.length];
        this.flag[0]=1;
}
public void simple()
{
this.dp[0]=this.array[0];
for(int i=1;i<this.array.length;i++)
{

if(this.dp[i-1]<0)
{
this.dp[i]=this.array[i];
//说明重新开始,记录断点即可
this.flag[i]=1;
}
else
{
this.dp[i]=this.dp[i-1]+this.array[i];
}
}
int max=this.dp[0];
int maxflag=0;
for(int i=1;i<this.dp.length;i++)
{
if(max<this.dp[i])
{
max=this.dp[i];
maxflag=i;
}
}
System.out.println(max);
   for(int i=maxflag;i>=0;i--)
   {
    System.out.print(this.array[i]+" ");
    if(this.flag[i]==1)
    {
    break;
    }
   }
}
public static void main(String []args)
{
int []a={1,-2,3,10,-4,7,2,-5};
MaxSubArray msa=new MaxSubArray(a);
msa.simple();
}
}