Codeforces Round #335 (Div. 1) A. Sorting Railway Cars
来源:互联网 发布:parseint javascript 编辑:程序博客网 时间:2024/05/17 23:28
题意:n个数编号1~n,现在给出乱序的n个数,其中任意一个数可以掉到序列头或序列尾,最终使得这个序列按递增的顺利排列,也就是按照1~n排列,问最少需要操作多少次
贴代码吧,直接套用最长递增子序列的板子会超时,只能看着别人的去优化了,而且还必须弄成全局变量,不然第10个用例会wa掉,简直wa哭了
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int n,p[100010],i,k,dp[100010],ans=0;int main(){ while(scanf("%d",&n)!=EOF) { for(i=1;i<=n;i++) { scanf("%d",&p[i]); } for(i=1;i<=n;i++) { dp[p[i]]=dp[p[i]-1]+1; ans=max(ans,dp[p[i]]); } printf("%d\n",n-ans); }}
0 0
- Codeforces Round #335 (Div. 1) A. 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) C. Sorting Railway Cars
- Codeforces Round #335 (Div. 2)C. 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) 606C Sorting Railway Cars(hash)
- Codeforces Round #335 (Div. 2)-C Sorting Railway Cars(最长上升子序列)
- CF 335 div.2-C/div.1-A/605A Sorting Railway Cars
- Sorting Railway Cars----CodeForces 605A
- codeforces 605 A Sorting Railway Cars
- Codeforces 605A Sorting Railway Cars [贪心]
- 【Codeforces 605A】【贪心】Sorting Railway Cars
- Codeforces 605A.Sorting Railway Cars【技巧】
- codeforces 335 C Sorting Railway Cars
- 605A Sorting Railway Cars
- CodeForces 605 A.Sorting Railway Cars(贪心)
- 已知圆心,半径,角度,求圆上的点坐标
- [iOS]arc4random_uniform()函数
- Android Studio上方便使用butterknife注解框架的偷懒插件Android Butterknife Zelezny
- ViewPager -- Fragment 切换卡顿 性能优化
- 三方依赖库在Cocoapods上的制作流程2015年版
- Codeforces Round #335 (Div. 1) A. Sorting Railway Cars
- 批处理(.bat)学习笔记
- Android蓝牙打印机例子
- Spark 提交任务时,报: Invalid signature file digest for Manifest main attributes
- 几行代码实现tab+fragment+viewpager---还有酷炫的动画效果哦
- CMS用通用图片轮换flash幻灯片播放器:Bcastr3和Bcastr4
- python数据分析之kDD(二)
- log4j.properties配置文件配置项的说明
- window.getSelection()相关