code_算法导论.rar

function [max_left,max_right,max_sum]=find_max_sub(A,low,high) if high==low max_left=low;max_right=low;max_sum=A(low); else mid=floor((low+high)/2); [left_low,left_high,left_sum]=find_max_sub(A,low,mid); [right_low,right_high,right_sum]=find_max_sub(A,mid+1,high); [cross_low,cross_high,cross_sum]=find_max_cross(A,low,mid,high); a_v=[left_sum,right_sum,cross_sum]; [max_sum,k]=max(a_v); if k==1 max_left=left_low;max_right=left_high; elseif k==2 max_left=right_low;max_right=right_high; else max_left=cross_low;max_right=cross_high; end end