Sorting Railway Cars
2016-05-25 21:00
405 查看
Description
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?
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 if i ≠ 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
Input
Output
Input
Output
Hint
In the first sample you need first to teleport the 4-th car, and then the 5-th car to the end of the train.
找出它的升序个数,,如输入5个数,然后 2 3 1 4 5就是4输出1
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
#define N 100009
int a
,dp
;
int main()
{
int i, n, f;
while(scanf("%d",&n)!=EOF)
{
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{
dp[a[i]]=dp[a[i]-1]+1;
}
f=0;
for(i=0;i<n;i++)
{
f=max(f, dp[i]);
}
printf("%d\n",n-dp[i]);
}
return 0;
}
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?
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 if i ≠ 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
Input
5 4 1 2 5 3
Output
2
Input
4
4 1 3 2
Output
2
Hint
In the first sample you need first to teleport the 4-th car, and then the 5-th car to the end of the train.
找出它的升序个数,,如输入5个数,然后 2 3 1 4 5就是4输出1
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
#define N 100009
int a
,dp
;
int main()
{
int i, n, f;
while(scanf("%d",&n)!=EOF)
{
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{
dp[a[i]]=dp[a[i]-1]+1;
}
f=0;
for(i=0;i<n;i++)
{
f=max(f, dp[i]);
}
printf("%d\n",n-dp[i]);
}
return 0;
}
相关文章推荐
- vainish详解
- LeetCode题解——Palindrome Pairs
- 【CodeForces】651B - Beautiful Paintings(暴力)
- 【Leetcode】Container With Most Water
- 开源的人工智能项目 Torch 和 FacebookAI 工具
- 【leetcode】217. Contains Duplicate
- linux 系统监控、诊断工具之 IO wait
- Codeforces Round #353 (Div. 2) B. Restoring Painting
- BIO,NIO,AIO
- 【异常】No ManagedConnections available within configured blocking timeout
- IntelliJ中的main函数和System.out.println()快捷键
- delphi indy控件 idsmtp 邮件发送 gmail
- 从 MainTabViewController的一个子页面跳到另一个子页面
- http://blog.csdn.net/fenghome/article/details/5708219
- Failure [INSTALL_FAILED_SHARED_USER_INCOMPATIBLE]
- xilinx sdk debug 无法进入main函数解决方法
- 免费超大量邮件发送服务Amazon SES和Mailgun提供SMTP和API支持
- mailx for smtps over qqexmail
- 关于上gmail 出现需要验证链接
- 以form表单上传文件,接口不响应,后台显示"file" does not contain '/'