Codeforces Round #335 (Div. 2) C. Sorting Railway Cars
2016-08-24 13:19
295 查看
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.
Examples
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.
思路:因为最后的答案一定是1,2,3,4,。。。。n;
所以我本来想求最长公共子序列,发现时间复杂度太大;
后来想因为一定上升只要求最长连续上升即可;
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.
Examples
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.
思路:因为最后的答案一定是1,2,3,4,。。。。n;
所以我本来想求最长公共子序列,发现时间复杂度太大;
后来想因为一定上升只要求最长连续上升即可;
#include<bits/stdc++.h> using namespace std; #define ll __int64 #define esp 1e-13 const int N=1e5+10,M=1e6+1000,inf=1e9+10,mod=1000000007; int a ; int dp ; int flag ; int main() { int x,y,z,i,t; scanf("%d",&x); for(i=1;i<=x;i++) scanf("%d",&y),flag[y]=i; dp[1]=1; for(i=2;i<=x;i++) { dp[i]=1; if(flag[i]>flag[i-1]) dp[i]=dp[i-1]+1; } int ans=1; for(i=1;i<=x;i++) ans=max(ans,dp[i]); printf("%d\n",x-ans); return 0; }
相关文章推荐
- Codeforces Round #335 (Div. 2) C.Sorting Railway Cars
- 【CodeForces 605A】BUPT 2015 newbie practice #2 div2-E - Sorting Railway Cars
- CF #335 div1 A. Sorting Railway Cars
- 【Codeforces Round 335 (Div 2) C】【贪心 脑洞 有趣排序】Sorting Railway Cars 全排列排序可以提前后提后的最小操作数
- Codeforces Round #335 (Div. 2) C. Sorting Railway Cars 最长连续上升子序列
- Codeforces Round #335 (Div. 2) C. Sorting Railway Cars 最长连续上升子序列
- Codeforces Round #335 (Div. 2)C. Sorting Railway Cars
- Codeforces Round #335 (Div. 2) C. Sorting Railway Cars 动态规划
- Codeforces Round #335 (Div. 1) A. Sorting Railway Cars
- Codeforces Round #335 (Div. 2)-Sorting Railway Cars(求连续的上升序列的最大值)
- Codeforces Round #335 (Div. 2)-C Sorting Railway Cars(最长上升子序列)
- Codeforces Round #335 (Div. 2) C. Sorting Railway Cars
- codeforces 335 C Sorting Railway Cars
- CodeForces 605 A.Sorting Railway Cars(贪心)
- CodeForces 606C--Sorting Railway Cars,思路题~~~
- 【Codeforces 605A】【贪心】Sorting Railway Cars
- Codeforce----Sorting Railway Cars
- CF 605A(Sorting Railway Cars-贪心)
- [Codeforces 606C]Sorting Railway Cars
- Sorting Railway Cars