01-复杂度1 最大子列和问题

#include <stdio.h>

int MaxSub(int A[],int N){
    return MaxSubSeq(A,0, N-1);
}
int Max3(int x, int y, int z){
	if(x > y){
		if(x > z){
			return x;
		}
		else{
			return z;
		}
	}
	else{
		if(y > z){
			return y;
		}
		else{
			return z;
		}
	}
}
int MaxSubSeq(int A[],int Left,int Right){
	int MaxLeftSum,MaxRightSum;
	int MaxLeftBorderSum,MaxRightBorderSum;
	int LeftBorderSum,RightBorderSum;
	if(Left == Right){
		if(A[Left] > 0){
			return A[Left];
		}
		else 
			return 0;
	}
	int Mid = (Left + Right)/2;
	MaxLeftSum = MaxSubSeq(A,Left,Mid);
	MaxRightSum = MaxSubSeq(A,Mid+1, Right);
	MaxLeftBorderSum = 0;LeftBorderSum = 0;
	int i;
	for(i = Mid; i >= Left ; i--){
		LeftBorderSum += A[i];
		if(LeftBorderSum > MaxLeftBorderSum){
			MaxLeftBorderSum = LeftBorderSum;
		}
	}
	MaxRightBorderSum = 0; RightBorderSum = 0;
	for(i = Mid+1; i<= Right; i++){
		RightBorderSum += A[i];
		if(RightBorderSum > MaxRightBorderSum){
			MaxRightBorderSum = RightBorderSum;
		}
	}
	
	return Max3(MaxLeftSum,MaxRightSum, (MaxLeftBorderSum + MaxRightBorderSum));
}

int main(){
	int K;
	int i;
	scanf("%d",&K);
	int Arr[K];
	for(i = 0 ; i< K; i++){
		scanf("%d",&Arr[i]);
	}
	printf("%d",MaxSub(Arr,K));
	return 0;
	
}