Codeforces 605A. Sorting Railway Cars
Posted TOTOTOTOTZZZZZ
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Codeforces 605A. Sorting Railway Cars相关的知识,希望对你有一定的参考价值。
An infinitely long railway has a train consisting of n cars, numbered from 1 to n (the numbers of all the cars are distinct) and positioned in arbitrary order. David Blaine wants to sort the railway cars in the order of increasing numbers. In one move he can make one of the cars disappear from its place and teleport it either to the beginning of the train, or to the end of the train, at his desire. What is the minimum number of actions David Blaine needs to perform in order to sort the train?
The first line of the input contains integer n (1?≤?n?≤?100?000) — the number of cars in the train.
The second line contains n integers pi (1?≤?pi?≤?n, pi?≠?pj if i?≠?j) — the sequence of the numbers of the cars in the train.
Print a single integer — the minimum number of actions needed to sort the railway cars.
#include <iostream> #include <algorithm> #include <cstring> using namespace std; int f[100005]; int a[100005],pos[100005] = {0},n; int main(){ // freopen("test.in","r",stdin); cin >> n; for (int i=1;i<=n;i++){ cin >> a[i]; pos[a[i]] = i; } int res = 0,now = 0; // for (int i=1;i<=n;i++){ // cout << pos[i] << " "; // }cout << endl; for (int i=1;i<=n;i++){ if (pos[i] > pos[i-1]){ now ++; // cout << i << i-1 << now << res << endl; } else { res = max(now,res); now = 1; } } res = max(now,res); cout << n - res; }
以上是关于Codeforces 605A. Sorting Railway Cars的主要内容,如果未能解决你的问题,请参考以下文章
Codeforces Round #605(Div3)A~E
Codeforces Round #605 (Div. 3)
Codeforces Round #605 (Div. 3) E - Nearest Opposite Parity