간식 파티 [백준 20162]

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

 

 

n = int(input())
arr= []
for _ in range(n):
    k = int(input())
    arr.append(k) 

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

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