Submission #4010322


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(2e5);
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

Submission Time
Task B - Backfront
User Rtn_e
Language C++14 (GCC 5.4.1)
Score 500
Code Size 1498 Byte
Status AC
Exec Time 20 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 28
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt AC 20 ms 1024 KB
02.txt AC 20 ms 1024 KB
03.txt AC 20 ms 1024 KB
04.txt AC 20 ms 1024 KB
05.txt AC 20 ms 1024 KB
06.txt AC 20 ms 1024 KB
07.txt AC 17 ms 1024 KB
08.txt AC 17 ms 1024 KB
09.txt AC 17 ms 1024 KB
10.txt AC 17 ms 1024 KB
11.txt AC 19 ms 1024 KB
12.txt AC 19 ms 1024 KB
13.txt AC 19 ms 1024 KB
14.txt AC 19 ms 1024 KB
15.txt AC 19 ms 1024 KB
16.txt AC 20 ms 1024 KB
17.txt AC 20 ms 1024 KB
18.txt AC 20 ms 1024 KB
19.txt AC 17 ms 1024 KB
20.txt AC 18 ms 1024 KB
21.txt AC 20 ms 1024 KB
22.txt AC 19 ms 1024 KB
23.txt AC 2 ms 1024 KB
24.txt AC 2 ms 1024 KB
25.txt AC 2 ms 1024 KB
s1.txt AC 2 ms 1024 KB
s2.txt AC 2 ms 1024 KB
s3.txt AC 2 ms 1024 KB