Envío 6169

Código

def findBest(a):
    n = len(a)
    if n <= 1:
        return a[0];

    m = n // 2
    best = max(findBest(a[:m]), findBest(a[m:]))

    bsl = a[m-1]
    sl = a[m-1]
    for i in range(m-2, -1, -1):
        sl += a[i]
        bsl = max(bsl, sl)

    bsr = a[m]
    sr = a[m]
    for i in range(m+1, n):
        sr += a[i]
        bsr = max(bsr, sr)

    return max(best, bsl+bsr)

n = int(input())
a = [int(x) for x in input().split()]
print(findBest(a))