# Max subarray code 01
def max_subarray(A, low, mid, high):
    left_sum = -1000
    summ = 0
    for i in range(mid, low-1, -1):
        summ += A[i]
        if summ > left_sum:
            left_sum = summ
            max_left = i
    right_sum = -1000
    summ = 0
    for j in range(mid+1, high):
        summ += A[j]
        if summ > right_sum:
            right_sum = summ
            max_right = j
    return(max_left, max_right, left_sum + right_sum)
L=[-1, 2, 3, 4, 5, 6, 7, 8, 9, -10]
max_subarray(L, 0, 5, 10)