find_best_subarray.py

def find_best_subarray(array):
    best_sum = 0
    best_start = 0
    best_end = 0

    cur_sum = 0
    cur_start = 0
    cur_end = 0

    for i, x in enumerate(array):
        cur_end = i + 1

        cur_sum += x

        if cur_sum < 0:
            cur_sum = 0
            cur_start = i + 1

        if cur_sum > best_sum:
            best_sum = cur_sum
            best_start = cur_start
            best_end  = cur_end

        print('i = {:=2}   x = {:=2}   cur_sum = {:=2}'.format(i, x, cur_sum))

    return best_sum, best_start, best_end


array = [-2, 1, -3, 4, -1, 2, 1, -5]
print('SOLUTION:')
print(find_best_subarray(array))