병사 배치하기(백준 18353)

 

n= int(input())
arr =list(map(int, input().split()))
arr.reverse()
dp= [1 for i in range(n)]
print(arr)
for i in range(1,n):
    for j in range(i):
        if arr[i] > arr[j] :
            dp[i] = max(dp[i], dp[j]+1)
    
print(n-max(dp))