分治算法递归求最大子数组，下标，和

#coding=utf-8
import math
def getCroosMaxNum(arr,low,mid,high):
    leftindex=0
    rightindex=0
    lsum=-(math.inf)
    leftsum=0
    a=list(range(low,mid))
    a.reverse()
    b=a
    for i in b:
        leftsum=arr[i]+leftsum
        if lsum<leftsum:
            lsum=leftsum
            leftindex=i
    rsum=-(math.inf)
    rightsum=0
    c=list(range(mid,high))
    d=c
    for j in d:
        rightsum=arr[j]+rightsum
        if rsum<rightsum:
            rsum=rightsum
            rightindex=j
    return leftindex,rightindex,lsum+rsum


def getMaxArray(arr,low,high):
    #arr=arr[low:high]
    if low==high:
        print(arr,low,high)#[3],0,1,[4,1,2]
        return low,high,arr[low]
    else: 
        mid=int((low+high)//2)
        
        leftlow,lefthigh,leftsum=getMaxArray(arr,low,mid)

        print("splitline")