题解 | #Redraiment的走法#
Redraiment的走法
https://www.nowcoder.com/practice/24e6243b9f0446b081b1d6d32f2aa3aa
N = int(input())
nums = list(map(int,input().strip().split()))
dp = [1]*N
for i in reversed(range(N)): # ->5,4,3,2,1,0
for j in range(i+1, N):
if nums[j] > nums[i]: # increasing
dp[i] = max(dp[i],dp[j]+1)
print(max(dp))
，这还是稳定一个月2.5w的前提，草了
