Submission #3585517

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#define lol(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
typedef long long ll;

using namespace std;
#define N 200010
ll n,p[N],a[N];
int main(){
    cin>>n;
    lol(i,n){cin>>p[i];a[p[i]-1]=i;}
    ll res=0,cur=1;
    for(ll i=1;i<n;i++){
	if(a[i-1]>a[i])cur=1;
	else cur++;
	res=max(res,cur);
    }
    cout<<n-res<<endl;
    return 0;
}

Submission Info

Judge Result