250672026-02-17 19:00:38sarminRendező robot (80 pont)cpp17Accepted 80/8027ms2008 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// const ll MOD = 1e9+7;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n; cin >> n;
    vector<int> pos(n+1);
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
    	cin >> a[i];
    	pos[a[i]] = i;
    }
    
    int mn = INT_MAX;
    int start = 1;
    for (int i = 2; i <= n; i++) {
    	if (pos[i-1] > pos[i]) {
    		int x = start-1, y = n-i+1;
    		mn = min(mn, max(max(0, 2*x-1), 2*y));
    		start = i;
    	}
    }
    int x = start-1, y = 0;
    mn = min(mn, max(max(0, 2*x-1), 2*y));
    cout << mn << "\n";
    
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base80/80
1Accepted0/01ms316 KiB
2Accepted0/01ms508 KiB
3Accepted2/21ms500 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms328 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/21ms316 KiB
9Accepted2/21ms316 KiB
10Accepted2/21ms436 KiB
11Accepted2/21ms316 KiB
12Accepted2/21ms316 KiB
13Accepted2/21ms508 KiB
14Accepted2/21ms348 KiB
15Accepted2/21ms356 KiB
16Accepted2/21ms316 KiB
17Accepted2/21ms316 KiB
18Accepted4/427ms1844 KiB
19Accepted4/426ms1848 KiB
20Accepted4/426ms1844 KiB
21Accepted4/425ms1844 KiB
22Accepted4/424ms1960 KiB
23Accepted4/424ms1844 KiB
24Accepted4/427ms2000 KiB
25Accepted4/427ms1844 KiB
26Accepted4/424ms1984 KiB
27Accepted4/427ms2008 KiB
28Accepted4/425ms1844 KiB
29Accepted4/425ms1844 KiB