题解 | #最长上升子序列(一)#

n = int(input())
arrs = list(map(int, input().split()))


def solution(arrs: list[int]) -> int:
    dp = [1 for i in range(n)]
    for i in range(1, n):
        for j in range(i):
            if arrs[i] > arrs[j]:
                dp[i] = max(dp[i], dp[j] + 1)
    return max(dp)

print(solution(arrs))