面试题31：连续子数组的最大和

package offer;
public class  {
	public int findGreatestSum(int[] arr){
		int greatest = 0x80000000; 
		int cursum=0;
		for(int i=0;i<arr.length;i++){
			if(cursum<=0)
				cursum=arr[i];
			else
				cursum+=arr[i];
			if(greatest<cursum)
				greatest=cursum;
		}
		return greatest;
	}
	public static void main(String[] args){  
        int[] arr={-1,-2,-3,-10,-4,-7,2,-5};  
        t31 test = new t31();  
        System.out.println(test.findGreatestSum(arr));  
    } 
}