codeforces335 div1 Sorting Railway Cars
来源:互联网 发布:淘宝发送宝贝链接 编辑:程序博客网 时间:2024/06/15 12:43
题意:给你一个数列是1-n的数,让你最终让他们有序排列,你每次只能移动一个数到数列的头部或者尾部。问你最少需要移动几次。
开始还没有明白这个题是考的什么知识点,后来才发现就是考一个连续的子序列问题,最后用总数减去最长的序列就可以了。还是做题太少,别人一眼就看出来了。
#include<bits/stdc++.h>using namespace std;int main(){ int n; while(~scanf("%d",&n)) { int a[100005]; for(int i=0;i<n;i++) { int x; scanf("%d",&x); a[x-1]=i; } int cur=1,ans=1; for(int i=1;i<n;i++) { if(a[i]>a[i-1]) cur++; else cur=1; ans=max(ans,cur); } printf("%d\n",n-ans); }}
0 0
- codeforces335 div1 Sorting Railway Cars
- 贪心--Sorting Railway Cars
- Sorting Railway Cars
- C - Sorting Railway Cars
- C. Sorting Railway Cars
- Sorting Railway Cars
- Sorting Railway Cars
- Sorting Railway Cars
- 605A Sorting Railway Cars
- CF 605A(Sorting Railway Cars-贪心)
- codeforces C. Sorting Railway Cars 贪心
- Sorting Railway Cars----CodeForces 605A
- codeforce 606C Sorting Railway Cars
- codeforces 605 A Sorting Railway Cars
- Codeforces 606 C Sorting Railway Cars【思维】
- Codeforces 606 C Sorting Railway Cars
- Codeforces 605A Sorting Railway Cars [贪心]
- 【Codeforces 605A】【贪心】Sorting Railway Cars
- python多线程抓取类
- 轻松解读网络术语
- 图像处理算法基础(四)---中值滤波自实现及opencv函数
- 宏定义中的#和##的宏展开问题
- Android 获取SDCard上图片和视频的缩略图
- codeforces335 div1 Sorting Railway Cars
- XSS quiz 11~16解题方案
- C#学习笔记
- Java查询大文本
- 分布式TCP压力测试工具 tcpcopy
- Centos Linux下流媒体服务器Helix配置
- JavaScript核心知识点总结
- det--求矩阵的行列式
- NSString的小结