Sorting Railway Cars

Description

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?

Input

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.

Output

Print a single integer — the minimum number of actions needed to sort the railway cars.

Sample Input

Input
5
4 1 2 5 3

Output
2

Input
4
4 1 3 2

Output
2

Hint

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.

题意：给你一个打乱顺序后的从1~n的序列，每个数都可以移到最前边或者最后边，求最少用多少步能够把这个序列还原为从1到n的递增序列。

思路：
跑比之前大1的数组就做行了。
代码：

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
const int N=100000+10;
int a[N],b[N];
int main()
{
    int n,i;
    while(~scanf("%d",&n))
    {
        memset(b,0,sizeof(b));
        memset(a,0,sizeof(a));
        for(i=1; i<=n; i++)
        {
            scanf("%d",&a[i]);
            b[a[i]]=b[a[i]-1]+1;
        }
        sort(b+1,b+n+1);
        if(b[n]==n)
            printf("0\n");
        else
            printf("%d\n",n-b[n]);
    }
    return 0;
}