Submission #4010313

---

Source Code Expand

/* Madar Bozorg migoft : "dorost mishavad"
va hamishe badash b aseman negah mikard o mikhandid
hatm daram k chiz haii ""DARBARE KHODA"" midanest
k ma az an bi khabar budim :) */
//RTn_E
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define _file freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define ll long long
#define ld long double
#define sp setprecision
#define pb push_back
#define F first
#define S second
#define mk make_pair
#define pii pair < int , int >
#define piii pair < int , pair < int , int > >
template <typename T> using ordered_set =  tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll mod = 1e9 + 7;
const int maxn = 1e6 + 100;
const ll inf = 1e18;

//Main CODE :/\

vector < int > inv(1e5);
int main() {
    ios_base :: sync_with_stdio(false) , cin.tie(0) , cout.tie(0);
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        int p;
        cin >> p;
        p--;
        inv[p] = i;
    }
    int maxv = 0;
    int tmp = 0;
    for (int i = 1; i < n; i++){
        if (inv[i - 1] < inv[i])
            tmp++;
        else {
          maxv = max(maxv, tmp);
          tmp = 0;
        }
    }
    maxv = max(maxv, tmp);
    int ans = n - maxv - 1;
    cout << ans << "\n";
    return 0;
}
//The_End
//Game Over :D

Submission Info

Judge Result