题解 | #合唱队#
合唱队
https://www.nowcoder.com/practice/6d9d69e3898f45169a441632b325c7b4
# 计算每个人左边比他矮的人数，最小值是1
def f(ls):
dp = [1]*len(ls)
for i in range(len(ls)):
for j in range(i+1):
if ls[j] < ls[i]:
dp[i] = max(dp[i],dp[j]+1)
return dp
N = int(input())
ls = list(map(int,input().split()))
dp1 = f(ls)
dp2 = f(ls[::-1])[::-1]
ld = []
for i in range(len(ls)):
ld.append(dp1[i]+dp2[i])
m = max(ld)-1
print(N-m)
查看12道真题和解析