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

import sys

def get_longest_sub_list_len(n, nums):
    if li_len == 0:
        return 0
    dp = [1] * n
    for i in range(n):
        for j in range(i):
            if nums[i] > nums[j]:
                dp[i] = max(dp[j] + 1, dp[i])
                
    return max(dp)


try:
    line = sys.stdin.readline().strip()
    lines = line.split()
    li_len = int(lines[0])
    line = sys.stdin.readline().strip()
    lines = line.split()
    nums = map(int, lines)
    print get_longest_sub_list_len(li_len, nums)
    
except:
    pass