最大连续子序列和

public static int findMaxSum(int [] a){
	int maxSum=0;
	int thisSum=0;
	for(int i=0,j=0;j<a.length;j++){
		thisSum+=a[j];
		if(maxSum<thisSum){
			maxSum=thisSum;
			seqStart=i;
			seqEnd=j;
		}
		else if(thisSum<0){
			i=j+1;
			thisSum=0;
		}
	}
	return maxSum;
}