Codeforces Round #335 (Div. 2) C.Sorting Railway Cars
来源:互联网 发布:金域名邸 编辑:程序博客网 时间:2024/06/05 04:14
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?
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.
Print a single integer — the minimum number of actions needed to sort the railway cars.
54 1 2 5 3
2
44 1 3 2
2
In the first sample you need first to teleport the 4-th car, and then the5-th car to the end of the train.
题意:给出n个数(1~n),每次可以将任意一个数放到头部或末尾,求最少变化次数使得数列最后从小到大排列。
思路:细心一看是求最长的等差数列(公差为1)的长度s,结果便是n-s;
#include <stdio.h>#define MAX 100005int a[MAX],c[MAX];int main(){ int i,n, max = 0; scanf("%d",&n); { for(i=0;i<n;i++){ scanf("%d",&a[i]); c[a[i]] = c[a[i]-1] + 1; if(c[a[i]] > max) max = c[a[i]]; } printf("%d\n",n - max); }}
- 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) 605A Sorting Railway Cars
- Codeforces Round #335 (Div. 2) C. Sorting Railway Cars 最长连续上升子序列
- Codeforces Round #335 (Div. 2) 606C Sorting Railway Cars(hash)
- 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 335 C Sorting Railway Cars
- 【Codeforces Round 335 (Div 2) C】【贪心 脑洞 有趣排序】Sorting Railway Cars 全排列排序可以提前后提后的最小操作数
- codeforces C. Sorting Railway Cars 贪心
- Codeforces 606 C Sorting Railway Cars【思维】
- Codeforces 606 C Sorting Railway Cars
- CF 335 div.2-C/div.1-A/605A Sorting Railway Cars
- C - Sorting Railway Cars
- C. Sorting Railway Cars
- CodeForces 606C--Sorting Railway Cars,思路题~~~
- 文章标题
- 哈理工1311 并查集+map火影忍者之~忍者村
- nginx源码解读之二--nginx_string_t
- 初学Redis(3)——简单实现Redis缓存中的排序功能
- 社交网络节点理论
- Codeforces Round #335 (Div. 2) C.Sorting Railway Cars
- Apache+tomcat集群 简易版环境搭建
- POJ1743 Musical Theme 后缀数组
- 使用 Tomcat 7 新的连接池 —— Tomcat jdbc pool
- 排序二叉树
- C++ Primer 学习笔记——类(一)
- 【Javascript】二维数组
- 每天进步一点点——MySQL多实例
- [Leetcode]Range Sum Query