Codeforces Round #335 (Div. 2) C. Sorting Railway Cars 最长连续上升子序列
2015-12-10 21:14
381 查看
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
题意:给你一个序列,你可以将序列中的任意一个数取出来放到序列的第一位或者最后一位,问你最少多少次就可以把该序列转换成一个递增的序列。
思路:从后向前遍历,假如现在遍历到了a[k],那么寻找a[k]+1,而[b]a[k]+1已经在之前做了类似操作[b],依次类推就能找到以a[k]为起点的最长上升子序列了。[/b][/b]
代码:
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
题意:给你一个序列,你可以将序列中的任意一个数取出来放到序列的第一位或者最后一位,问你最少多少次就可以把该序列转换成一个递增的序列。
思路:从后向前遍历,假如现在遍历到了a[k],那么寻找a[k]+1,而[b]a[k]+1已经在之前做了类似操作[b],依次类推就能找到以a[k]为起点的最长上升子序列了。[/b][/b]
代码:
#include <cstdio> #include <iostream> #include <vector> #include <algorithm> #include <cmath> #include <cstring> using namespace std; #define inf 0x3f3f3f3f #define maxn 100011 typedef long long ll; int a[maxn],dp[maxn]; //dp[k]代表以k为起点的最长连续上升子序列的长度 int main() { #ifdef CDZSC_June freopen("t.txt","r",stdin); #endif int n; while(~scanf("%d",&n)) { for(int i = 1; i<= n; i++) { scanf("%d",&a[i]); dp[i] = 0; } dp[n+1] = 0; for(int i = n; i>= 1; i--) { dp[a[i]] = dp[a[i] + 1] +1; } sort(dp+1,dp+n+1);//排序找到最大值 printf("%d\n",n - dp ); } }
相关文章推荐
- Codeforces Round #335 (Div. 2) 605A Sorting Railway Cars
- Daily Scrum NO.3
- Daily Scrumming* 2015.12.10 今天集体请假一天
- 解决nginx: [error] open() "/usr/local/nginx/logs/nginx.pid" failed错误
- zzulioj--1089--make pair(dfs+模拟)
- zzulioj--1089--make pair(dfs+模拟)
- The Longest Straight
- View工作原理(一)事件传递原理详解http://blog.csdn.net/ff20081528/article/details/17353869
- Codeforces Round #335 (Div. 2)-Sorting Railway Cars(求连续的上升序列的最大值)
- 走迷宫机器人程序之3--main
- 正在创造“情感计算”的微软小冰,或将开启未来计算新纪元
- 中国雾霾 China smog_ Sky dark from air pollution
- LightOJ 1071 - Baker Vai(水DP)
- Factorial Trailing Zeroes
- Setup MIPS cross compile toolchain
- Codeforces Round #335 (Div. 2) C. Sorting Railway Cars 动态规划
- Climbing Stairs
- (BUG) SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder"问题解决 .
- 性能测试分享: Jmeter的源码分析main函数参数
- 【Codeforces Round 335 (Div 2) C】【贪心 脑洞 有趣排序】Sorting Railway Cars 全排列排序可以提前后提后的最小操作数