Submission #3570589

---

Source Code Expand

// Ala be zekrellah tatmaenolgholoob ...
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define F first
#define S second
#define MP make_pair
const int maxn = 2e5+9;
const ll mod = 1e9+7;

int a[maxn], pos[maxn];

int main () {
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		pos[a[i]] = i;
	}
	int ans = 0;
	int cur = n, f = 1;
	while (cur - 1 && pos[cur] > pos[cur - 1]) {
		cur--;
		f++;
	}
	ans = f;
	cur = 1, f = 1;
	while (cur - n && pos[cur] < pos[cur + 1]) {
		cur++;
		f++;
	}
	ans = max(ans, f);
	cout << n - ans << "\n";
}

Submission Info

Judge Result