题解 | 拦截导弹

#最长递减子序列。
n = int(input())
arr = list(map(int,input().split()))
dp = [1 for _ in range(n)]
dp1 = [1]*n
for i in range(1,n): 
    for j in range(i):
        if arr[i] > arr[j]:
            dp1[i] =max(dp1[j]+1,dp1[i])
        else:
            dp[i] =max(dp[j]+1,dp[i])               
print(max(dp))
print(max(dp1))