题解 | #Redraiment的走法#
Redraiment的走法
https://www.nowcoder.com/practice/24e6243b9f0446b081b1d6d32f2aa3aa
n=int(input())
l=list(map(int,input().split()))
a=[1 for i in range(n)]
for i in range(1,n):
for j in range(i):
if l[j]<l[i]:
a[i]=max(a[j]+1,a[i])
print(max(a))
查看3道真题和解析