Maximum sum

n = int(input())

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

# print("numlist:", numList)

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

# # 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[1] = numList[0]

# # algorithm
# for i in range(1, n + 1):
#   dp[i] = max(dp[i])

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: ACCEPTED