An infinitely long railway has a train consisting of n cars, numbered from 1 to n (the numbers of all the cars are distinct) and positioned in arbitrary order. David Blaine wants to sort the railway cars in the order of increasing numbers. In one move he can make one of the cars disappear from its place and teleport it either to the beginning of the train, or to the end of the train, at his desire. What is the minimum number of actions David Blaine needs to perform in order to sort the train?
The first line of the input contains integer n (1 ≤ n ≤ 100 000) — the number of cars in the train.
The second line contains n integers pi (1 ≤ pi ≤ n, pi ≠ pj if i ≠ j) — the sequence of the numbers of the cars in the train.
Print a single integer — the minimum number of actions needed to sort the railway cars.
5 4 1 2 5 3
2
4 4 1 3 2
2
In the first sample you need first to teleport the 4-th car, and then the 5-th car to the end of the train.
题意:
给你一个n表示有1~n辆汽车,接下来是n辆汽车的排序,你可以把某一辆汽车放在序列的最前面,也可以放在序列的最后面,问你最少操作几次可以把序列变成有序上升,即1.2.3.4....n
分析:
求出原始序列中最长的有序上升序列len,再用长度n-len即为最少操作次数。
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int b[100005];
int main()
{
int n,a;
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&a);
b[a]=b[a-1]+1;
}
sort(b+1,b+n+1);
printf("%d\n",n-b[n]);
}