Maximum sum

n = int(input())

numList = None
numList = list(map(int, input().split()))

# print("numlist:", numList)

current_sum = 0
max_sum = -float('inf')

for num in numList:
    current_sum = max(num, current_sum + num)
    max_sum = max(max_sum, current_sum)

print(max_sum)

# maxSum = numList[0]
# for i in range(n):
#   currSum = 0
#   for j in range(i, n):
#     currSum += numList[j]
#     maxSum = max(maxSum, currSum)

# print(maxSum)

# initialise dp
dp = [0] * (n + 1)

# objective: get max sum in any subarray

# base cases
# 1. when array len is 1, then ans is just the int
# dp[1] = int itself
# dp[0] = numList[0]

# # algorithm
# for i in range(1, n):
#   currSum = 0
#   for j in range(i, n + 1):
#     currSum += numList[i - 1]
#     dp[i] = max(dp[i - 1], currSum)

# print(dp[n - 1])

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