2015 Changchun F
来源:互联网 发布:数控编程教学视频 编辑:程序博客网 时间:2024/05/20 09:06
题目链接:
http://acm.hdu.edu.cn/showproblem.php?pid=5532
题目大意:
给一个序列,判断是否是Almost Sorted Array,即去掉一个数后剩余序列是非严格单调序列。
这是一个LIS啊LIS。。。
只要求出LIS的长度=n-1,那么这个序列就是Almost Sorted Array,否则必然不是
签到题都是DP,区域赛的恶意。。
#include<stdio.h>#include<math.h>#include<algorithm>#include<iostream>#include<queue>using namespace std;const int MAXN=1<<17;int d[MAXN];int re[MAXN];int main(){int T;scanf("%d",&T);while(T--){int n;scanf("%d",&n);for(int i=0;i<n;i++)scanf("%d",&d[i]);int cur=0;re[++cur]=d[0];//升序LDSfor(int i=1;i<n;i++){if(d[i]>=re[cur])re[++cur]=d[i];elseif(d[i]<re[1])re[1]=d[i];else{int left,right;left=1;right=cur;while(left<right-1){int mid=(left+right)/2;if(re[mid]<=d[i])left=mid;elseright=mid;}if(d[i]<=re[right])re[right]=d[i];elsere[left]=d[i];}}if(cur>=n-1){printf("YES\n");continue;}//降序LIS cur=0; re[++cur]=d[n-1]; for(int i=n-2;i>=0;i--){ if(d[i]>=re[cur]) re[++cur]=d[i]; else if(d[i]<re[1]) re[1]=d[i]; else{ int left, right; left=1;right=cur; while(left<right-1){ int mid=(left+right)/2; if(re[mid]<=d[i]) left=mid; else right=mid; } if(d[i]<=re[right]) re[right]=d[i]; else re[left]=d[i]; } } if(cur>=n-1){ printf("YES\n"); continue; } else{ printf("NO\n"); }}return 0;}
0 0
- 2015 Changchun F
- 2015 ACMICPC Asia Regional Changchun Online
- 2015 ACM/ICPC Asia Regional Changchun Online
- 2015 ACM/ICPC Asia Regional Changchun Online
- 2015 ACM/ICPC Asia Regional Changchun Online(1002)
- 2015长春网络赛 ACM/ICPC Asia Regional Changchun Online
- 2015 ACM/ICPC Asia Regional Changchun Online(1007)
- 2015 ACM/ICPC Asia Regional Changchun Online hdu 5438
- hdu5443(2015 ACM/ICPC Asia Regional Changchun Online )
- Alisha’s Party--2015 ACM/ICPC Asia Regional Changchun Online
- 【题解】 2015 ACM/ICPC Asia Regional Changchun Online (5+2)
- 2015 ACM/ICPC Asia Regional Changchun Online(1001)
- HDU---5438-Ponds(DFS)(2015 Changchun)
- 2015 ACM/ICPC Asia Regional Changchun Online(1008)
- HDU---5441-Travel(并查集)(2015 Changchun)
- 2015 ACM/ICPC Asia Regional Changchun Online(1005)
- 2015 ACM/ICPC Asia Regional Changchun Online (部分)
- 2015 ACM/ICPC Asia Regional Changchun Online hdu5444
- 10006---JavaWeb基础--HttpServletResponse
- Spring注解详解
- Maven初步学习
- 苹果vs谷歌:与微软的战争教会了苹果什么
- JAVA多线程和并发基础面试问答(转载)
- 2015 Changchun F
- spring数据源配置
- LeetCode -- Container With Most Water
- ARM中关于绝对寻址相对寻址LDR,ADR的理解
- LeetCode -- Remove Invalid Parentheses
- Nexus私服使Maven更加强大
- 3D数学基础:图形与游戏开发_读书笔记01
- struts2读常量顺序
- Node Security