最长上升子序列

def solve():
    nums = [____, ____, ____, ____, ____, ____, ____, ____]
    if not nums:
        print(____)
        return
    dp = [____] * len(____)
    for i in range(____, len(____)):
        for j in range(____):
            if nums[i] > nums[j]:
                dp[i] = max(____)
    print(max(____))