最长递增子序列

def solve(____):
    nums = list(map(int, nums.split(____)))
    n = len(____)
    dp = [____] * n
    for i in range(____, n):
        for j in range(____):
            if nums[i] > nums[j]:
                dp[i] = max(____)
    print(max(____))