题解 | #合唱队#

def max_l(l):
	dp = [1] * len(l)
	for i in range(len(l)): # 从左往右遍历
		for j in range(i):
			if l[j]<l[i] and dp[i]<dp[j]+1:
				dp[i] = dp[j]+1
	return dp #1 1 1 2 2 1 3 4

input_int = int(input())
result = []
l = list(map(int,input().split())) #这里要取整数
left = max_l(l)
right = max_l(l[::-1])[::-1]
for i in range(input_int):
	result.append(left[i] + right[i]) 
print(input_int - max(result) + 1)