Maximum sum

n = int(input())
ints = input()
ints = [eval(i) for i in ints.split()]

largestSum = -999999999
subarrays = []

for i in range(len(ints)):
    for j in range(len(ints[i::])):
        subarray = ints[i:i+j+1]
        cSum = sum(subarray)
        if subarray != []:
            if cSum > largestSum:
                largestSum = cSum

print(largestSum)

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: WRONG ANSWER