题解 | Redraiment的走法
n=int(input())
s=list(map(int,input().split()))
dp=[1]*n
for i in range(n-1):
for j in range(i+1,n):
if s[j]>s[i]:
dp[j]=max(dp[i]+1,dp[j])
print(max(dp))
n=int(input())
s=list(map(int,input().split()))
dp=[1]*n
for i in range(n-1):
for j in range(i+1,n):
if s[j]>s[i]:
dp[j]=max(dp[i]+1,dp[j])
print(max(dp))
相关推荐