Maximum sum

def maxSum(n, arr):

    dp = {}
    for i in range(n):
        curr_num = arr[i]
        dp[i] = [0] * (n)
        dp[i][i] = curr_num
        for j in range(i + 1, n):

            
            dp[i][j] = dp[i][j - 1] + arr[j]

    result = 0
    for elements in dp.values():
        for element in elements:
            result = max(result, element)
    return result

def main():
    # input_1 = 8
    # input_2 = "-1 3 -2 5 3 -5 2 2"


    # n = input_1
    # arr = list(map(int, input_2.split()))

    n = int(input())
    arr = list(map(int, input().split()))
    print(maxSum(n, arr))

if __name__ == "__main__":
    main()

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

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

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER