最大子列和（递归、在线处理）——浙大数据结构（陈越）

public class Test1 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int[] a ={-1,3,-2,4,-6,1,6,-1,-3,4,1,-4,6,2,-4,5};
		System.out.println(maxSum1(a));
		System.out.println(maxSum2(a,0,a.length-1));
//		System.out.println(maxNum3(39,6,9));		
				
	}
	
	//时间复杂度为O(N)   在线处理
	public static int maxSum1(int[] a){
		int maxNum=0;
		int thisNum=0;
		for(int i=0;i<a.length;i++){
			thisNum+=a[i];
			if(thisNum<0)
				thisNum=0;
			if(thisNum>maxNum)
				maxNum=thisNum;
		}
		return maxNum;
	}
	
	//时间复杂度为O(NlogN) 递归求解
	public static int maxSum2(int[] a,int left,int right){
		if(left<right){
			int thisHalf=0;
			int maxHalf1=0;
			int maxHalf2=0;
			int center=(left+right)/2;
			int num1=maxSum2(a,left,center);
			int num2=maxSum2(a,center+1,right);
			for(int i=center;i>=left;i--){
				thisHalf=thisHalf+a[i];
				if(thisHalf>maxHalf1)
					maxHalf1=thisHalf;
			}
			thisHalf=0;
			
			for(int i=center+1;i<=right;i++){
				thisHalf=thisHalf+a[i];
				if(thisHalf>maxHalf2)
					maxHalf2=thisHalf;
			}
			int num3=maxHalf1+maxHalf2;
			return maxNum3(num1,num2,num3);			
		}
		else
			return a[left]>0?a[left]:0;
		
		
	}
	public static int maxNum3(int a,int b,int c){
		int max1=a>b?a:b;
		return max1>c?max1:c;
	}
}