C - Sorting Railway Cars

                                C - Sorting Railway Cars
       Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u
Submit
 
Status
 
Practice
 
CodeForces 606C
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.


之前的思路是错的，求最长增长子序列，然后n-长度
对于
6
6 3 2 4 5 1
是错的
后来知道应该是求最长增长子序列且增长差距为1的的，然后n-长度
#include<stdio.h>
#include<algorithm>
using namespace std;
int b[100005]={0};
int a[100005];
int main()
{
    int n,i;
    scanf("%d",&n);
    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]);
}