[python/파이썬] 백준 10211 Maximum Subarray

[문제 출처]

https://www.acmicpc.net/problem/10211

10211번: Maximum Subarray

 

[문제 풀이]

import sys
input = sys.stdin.readline

T = int(input())

for _ in range(T):
    n = int(input())
    arr = list(map(int, input().split()))
    arr.append(0)

    dp = [0 for _ in range(n)]
    dp[0] = arr[0]

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

    print(max(dp))