Contest Duration: - (local time) (130 minutes) Back to Home

Submission #2544563

Source Code Expand

Copy
```#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
/*---------------------------------------------------------------------------------------------------
∧＿∧
∧＿∧ 　（´<_｀ ）　 Welcome to My Coding Space!
（ ´_ゝ`）　/　 ⌒i
／　　　＼　 　  |　|
/　　 /￣￣￣￣/　　|
＿_(__ﾆつ/　    ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/　（u　⊃
---------------------------------------------------------------------------------------------------*/

int N, P[201010];
int dp[201010];
//---------------------------------------------------------------------------------------------------
void _main() {
cin >> N;
rep(i, 0, N) cin >> P[i];

int ans = 0;
rep(i, 0, N) {
int p = P[i];
dp[p] = dp[p - 1] + 1;
chmax(ans, dp[p]);
}

cout << N - ans << endl;
}```

Submission Info

Submission Time 2018-05-21 18:50:36+0900 B - Backfront hamayanhamayan C++14 (GCC 5.4.1) 500 1626 Byte AC 19 ms 1792 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 19 ms 1792 KB
02.txt AC 19 ms 1792 KB
03.txt AC 19 ms 1792 KB
04.txt AC 19 ms 1792 KB
05.txt AC 19 ms 1792 KB
06.txt AC 19 ms 1792 KB
07.txt AC 18 ms 1792 KB
08.txt AC 18 ms 1792 KB
09.txt AC 18 ms 1792 KB
10.txt AC 18 ms 1792 KB
11.txt AC 19 ms 1792 KB
12.txt AC 19 ms 1792 KB
13.txt AC 19 ms 1792 KB
14.txt AC 19 ms 1792 KB
15.txt AC 19 ms 1792 KB
16.txt AC 19 ms 1792 KB
17.txt AC 19 ms 1792 KB
18.txt AC 19 ms 1792 KB
19.txt AC 18 ms 1792 KB
20.txt AC 18 ms 1792 KB
21.txt AC 19 ms 1792 KB
22.txt AC 19 ms 1792 KB
23.txt AC 1 ms 256 KB
24.txt AC 1 ms 256 KB
25.txt AC 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB
s3.txt AC 1 ms 256 KB