Maximum sum

def su(toSum, start, end):
    return sum(toSum[start:end])

def stupidSol(toSum, size):
    ma = -int(1E10)
    for ii in range(size+1):
        for jj in range(ii, size+1):
            # print(ii,jj)
            if ii == jj:
                continue
            tmp = su(toSum, ii, jj)
            if tmp > ma:
                ma = tmp
    return ma

size = int(input())
toSum = tuple([int(aa) for aa in input().strip().split(" ")])
print(stupidSol(toSum, size))

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED