最大子数组

分治法

def find_max_sum(A,low,high):
    if high==low:
        return low,high,A[low]
    else:
        mid=(low+high)//2
        left_low,left_high,left_sum=find_max_sum(A,low,mid)
        right_low,right_high,right_sum=find_max_sum(A,mid+1,high)
        cross_low,cross_high,cross_sum=find_max_cross_sum(A,low,mid,high)
        if left_sum>=right_sum and left_sum>=cross_sum:
            return left_low,left_high,left_sum
        elif right_sum>=cross_sum:
            return right_low,right_high,right_sum
        else:
            return cross_low,cross_high,cross_sum
def find_max_cross_sum(A,low,mid,high):
    infinity=100000
    left_sum=-infinity
    sum=0
    for i in range(mid,low-1,-1):
        sum=sum+A[i]
        if sum>left_sum:
            left_sum=sum
            max_left=i
    right_sum=-infinity
    sum=0
    for j in range(mid+1,high+1):
        sum=sum+A[j]
        if sum>right_sum:
            right_sum=sum
            max_right=j
    return max_left,max_right,left_sum+right_sum
A=[13,-3,-25,20,-3,-16,-23,18,20,-7,12,-5,-22,15,-4,7]
a,b,c=find_max_sum(A,0,len(A)-1)
print(a,b,c)

暴力法

def find_max_sum_i(A,low,high):
    sumarr=A[low:high+1]
    for i in range(1,len(sumarr)):
        sumarr[i]=sumarr[i]+sumarr[i-1]
    infinity=100000
    sum=-infinity
    left,right=0,0
    for i in range(0,len(sumarr)):
        for j in range(i,len(sumarr)):
            tmp=sumarr[j]-sumarr[i]+A[low+i]
            if tmp>sum:
                left,right,sum=i,j,tmp
    return left,right,sum