zf_knjw的博客

原创 最大子数组的python代码

最大子数组python代码 import sys mins = -sys.maxsize def find_max_cross_subarray(A, low,mid, high): left_sum=mins sums = 0 for i in range(mid,low-1,-1): sums+=A[i] if sums > left_sum: left_sum=sums max_left=i right_sum=mins sums=0 for i in range(mid+1,high+1):