Maximum sum

def maxSum(n, arr):

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

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

def main():
    input_1 = 3
    input_2 = "1 2 3"

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

if __name__ == "__main__":
    main()

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER