贪心--Sorting Railway Cars
来源:互联网 发布:蜂窝移动网络 4g 编辑:程序博客网 时间:2024/05/21 15:03
Description
An infinitely long railway has a train consisting of n cars, numbered from1 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?
Input
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 ifi ≠ j) — the sequence of the numbers of the cars in the train.
Output
Print a single integer — the minimum number of actions needed to sort the railway cars.
Sample Input
54 1 2 5 3
2
44 1 3 2
2
Hint
In the first sample you need first to teleport the 4-th car, and then the5-th car to the end of the train.
题意:对已经编号任意排列的车子进行排序,使它们按照编号从小到大排序,序列中的车子只能往两端移动;求最小移动的步数
思路:求最长连续子序列。
样例1:
4 1 2 5 3最长连续子序列就是:* 1 2 * 3#include<stdio.h>#include<iostream>#include<algorithm>using namespace std;int dp[100005];int a[100005];int main(){ //freopen("input.txt","r",stdin); int n; while(~scanf("%d",&n)) { for(int i=1; i<=n; i++) scanf("%d",&a[i]); for(int i=1; i<=n; i++) dp[a[i]]=dp[a[i]-1]+1; int flag = 0; for(int i=1; i<=n; i++) flag = max(flag,dp[i]); printf("%d\n",n-flag); } return 0;}
- 贪心--Sorting Railway Cars
- CF 605A(Sorting Railway Cars-贪心)
- codeforces C. Sorting Railway Cars 贪心
- Codeforces 605A Sorting Railway Cars [贪心]
- 【Codeforces 605A】【贪心】Sorting Railway Cars
- Sorting Railway Cars
- C - Sorting Railway Cars
- C. Sorting Railway Cars
- Sorting Railway Cars
- Sorting Railway Cars
- Sorting Railway Cars
- CodeForces 605 A.Sorting Railway Cars(贪心)
- codeforces335 div1 Sorting Railway Cars
- 605A Sorting Railway Cars
- Sorting Railway Cars----CodeForces 605A
- codeforce 606C Sorting Railway Cars
- codeforces 605 A Sorting Railway Cars
- Codeforces 606 C Sorting Railway Cars【思维】
- bzoj1008 [HNOI2008]越狱
- win7系统桌面图标左下角全部出现蓝色问号,如何使其恢复?
- 不知不觉很久不写博客了
- android 自定义控件属性(TypedArray以及attrs解释)
- SVN 生命周期
- 贪心--Sorting Railway Cars
- 1.OracleBBED解析数据块——介绍
- 数盟
- 2.Oracle BBED解析数据块——准备BBED
- java动态代理
- 装机软件
- SVN 检出过程
- 技术支持联系方式
- Servlet3的上传配置@MultipartConfig