题解 | Redraiment的走法
Redraiment的走法
https://www.nowcoder.com/practice/24e6243b9f0446b081b1d6d32f2aa3aa
import sys
n = int(input())
nums = [int(_) for _ in input().split()]
dp = [1] * n
for i in range(n-1):
for j in range(i+1, n):
if nums[j] > nums[i]:
dp[j] = max(dp[j], dp[i] + 1)
print(max(dp))
dp[j] = max(dp[j], dp[i] + 1)
投递虾皮信息等公司8个岗位
