最长不下降子序列的长度

解题思路:

注意事项:

参考代码:

def lengthOfLIS(nums):

    if len(nums) <= 1:

        return len(nums)

    dp = [1] * len(nums)    # 长度最小都为1

    result = 1      # 初始化最大长度为1

    for i in range(1, len(nums)):

        for j in range(i):

            if nums[i] > nums[j]:

                dp[i] = max(dp[i], dp[j] + 1)

        result = max(result, dp[i])     #取长的子序列

    return result

n = int(input())

nums = list(map(int, input().split()))

print(lengthOfLIS(nums))