Maximum sum

def maxSum(n, arr):
    max_current = arr[0]
    result = arr[0]
    for i in range(1, n):
        max_current = max(arr[i], max_current + arr[i])
        result = max(result, max_current)
    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: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED