boj_11053_dp.py

import sys
input = sys.stdin.readline
N = int(input())

A = [0]

dp = [0] * (N+1)
dp_list = []

A += list(map(int, input().strip().split()))
    
for i in range(1, N+1):
    for j in range(i): 
        if A[i] > A[j]:
            dp[i] = max(dp[j]+1, dp[i])

print(max(dp))