# codeforces 605 A. Sorting Railway Cars (dp)

Posted by 111qqz on Tuesday, October 4, 2016

## TOC

dp[a[i]] = dp[a[i]-1] + 1

``````/* ***********************************************
Author :111qqz
Created Time :2016年10月04日 星期二 20时10分00秒
File Name :code/cf/problem/605A.cpp
************************************************ */

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <deque>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
#include <bitset>
#define fst first
#define sec second
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define ms(a,x) memset(a,x,sizeof(a))
typedef long long LL;
#define pi pair < int ,int >
#define MP make_pair

using namespace std;
const double eps = 1E-8;
const int dx4[4]={1,0,0,-1};
const int dy4[4]={0,-1,1,0};
const int inf = 0x3f3f3f3f;
const int N=1E5+7;
int n;
int a[N];
int dp[N];
int main()
{
#ifndef  ONLINE_JUDGE
freopen("code/in.txt","r",stdin);
#endif

cin>>n;
for ( int i = 1 ; i <= n ; i++) cin>>a[i];
ms(dp,0);
int mx = 0 ;
for ( int i = 1 ; i <= n ; i++)
{
dp[a[i]] = dp[a[i]-1] + 1;
mx = max(dp[a[i]],mx);
}
cout<<n-mx<<endl;

#ifndef ONLINE_JUDGE
fclose(stdin);
#endif
return 0;
}
``````

「真诚赞赏，手留余香」