[백준/파이썬] 1965번 상자넣기

-Code

n = int(input())
boxs = list(map(int, input().split()))
dp = [1] * n

for i in range(n):
    for j in range(i):
        if boxs[i] > boxs[j]:
            dp[i] = max(dp[i], dp[j] + 1)

print(max(dp))