Codeforces Round #335 (Div. 2) C. Sorting Railway Cars
2016-01-09 21:26
411 查看
C. Sorting Railway Cars
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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 test(s)
input
output
input
output
Note
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.
解题报告:Codeforces Round #335 Problem Analysis
题意
给你1-n的一个排列
然后你的操作是可以把一个数放到结尾或者首部
然后问你最少多少次操作,可以将这个排列变成递增的
题解:
首先跑最长上升子序列是错的
比如 1 2 4 5 3
最长上升子序列答案跑出来是1
但实际上答案是2所以只能跑严格只比之前大1的子序列就好了
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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 test(s)
input
5 4 1 2 5 3
output
2
input
4
4 1 3 2
output
2
Note
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.
解题报告:Codeforces Round #335 Problem Analysis
题意
给你1-n的一个排列
然后你的操作是可以把一个数放到结尾或者首部
然后问你最少多少次操作,可以将这个排列变成递增的
题解:
首先跑最长上升子序列是错的
比如 1 2 4 5 3
最长上升子序列答案跑出来是1
但实际上答案是2所以只能跑严格只比之前大1的子序列就好了
相关文章推荐
- AI学习笔记和制作棋子的教程
- [leetcode oj 217]Contains Duplicate
- Codeforces Round #338 (Div. 2) 615B Longtail Hedgehog(dp)
- Codeforces 615C:Longtail Hedgehog
- main函数的autoreleasepool有何用处
- LightOJ1021 Painful Bases(状压DP)
- 异步AIO的研究
- scu - 3254 - Rain and Fgj(最小点权割)
- 蓝牙写入出错,error isError Domain=CBATTErrorDomain Code=114 "Unknown ATT error."
- rails书籍展示添加游客评论
- Wait--使用sys.dm_io_virtual_file_stats来查看IO延迟
- 从notify-wait模式说去
- Contains Duplicate II leetcode
- 【转载】Kafka High Availability
- Contains Duplicate leetcode
- Codeforces Round #180 (Div. 2) B. Sail 贪心
- 职责链模式(Chain of Responsibility)
- offsetof与container_of宏[总结]
- Codeforces Round #338 (Div. 2) B. Longtail Hedgehog
- Codef b125 orces 615B Longtail Hedgehog 【dp】