가장긴증가하는부분수열.py

n = int(input())

arr = list(map(int, input().split()))


dp = [1] * (n+1)

dp[0] = 1


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