AtCoder - 3959

AtCoder - 3959
https://vjudge.net/problem/1583855/origin
求最长连续递增长度就行，答案是n-max(len)

#include<iostream>
#include<cstdio>
#include<queue>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<set>
#include<map>
#include<stack>
#include<cstring>
#define inf 2147483647
#define ls rt<<1
#define rs rt<<1|1
#define lson ls,nl,mid,l,r
#define rson rs,mid+1,nr,l,r
#define N 1000010
#define For(i,a,b) for(int i=a;i<=b;i++)
#define p(a) putchar(a)
#define g() getchar()
 
using namespace std;
int n;
int a[N],b[N];
int ans=;
void in(int &x){
    int y=;
    char c=g();x=;
    while(c<''||c>''){
        if(c=='-')y=-;
        c=g();
    }
    while(c<=''&&c>=''){
        x=(x<<)+(x<<)+c-'';c=g();
    }
    x*=y;
}
void o(int x){
    if(x<){
        p('-');
        x=-x;
    }
    if(x>)o(x/);
    p(x%+'');
}
int main(){
    in(n);
    For(i,,n)
        in(a[i]);
    b[a[]]=;
    For(i,,n){
        b[a[i]]=b[a[i]-]+;
        ans=max(ans,b[a[i]]);
    }
    o(n-ans);
    return ;
}