Python实现求解最大子数组问题

#! /usr/bin/env python
#coding=utf-8

def MaxCrossSubarray(a, low, mid, high):
    left_sum=-65535
    sum=0
    for i in range(mid, low-1, -1):#递减，实现mid至low！！！
        sum=sum+a[i]
        if sum>left_sum:
            left_sum=sum
            max_left=i
    right_sum=-65535
    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)

def MaxSubarray(a, low, high):
    if high==low:
        return (low, high, a[low])
    else:
        mid=(low+high)/2
        (left_low, left_high, left_sum)=MaxSubarray(a, low, mid)
        (right_low, right_high, right_sum)=MaxSubarray(a, mid+1, high)
        (cross_low, cross_high, cross_sum)=MaxCrossSubarray(a, low, mid, high)
        if left_sum>=right_sum and left_sum>=cross_sum:
            return (left_low, left_high, left_sum)
        elif right_sum>=left_sum and right_sum>=cross_sum:
            return (right_low, right_high, right_sum)
        else:
            return (cross_low, cross_high, cross_sum)

if __name__ == '__main__':
    a=[13, -3, -25, 20, -3, -16, -23, 18, 20, -7, 12, -5, -22, 15, -4, 7]
    max = MaxSubarray(a, 0, len(a)-1)
    print max