poj 2533 Longest Ordered Subsequence dp
来源:互联网 发布:chrome linux 编辑:程序博客网 时间:2024/06/05 16:25
这题看起来好熟悉,但其实我是第一次做
#include<iostream>#include<cstdio>#include<queue>#include<cstring>using namespace std;///priority_queue<int>que;const int maxn=1000+10;int rec[maxn];//dp[maxn];int main(){ int n; while(~scanf("%d",&n)) //输入数据竟然只有一组。。也是醉了。。 { // memset(rec,0,sizeof(rec)); int a,b; scanf("%d",&a); //dp[1]=1; rec[1]=a; int ans=1; for(int i=2;i<=n;i++) { int flag=1; scanf("%d",&b); for(int j=ans;j>=1;j--) if(rec[j]<b) { flag=0; if(j==ans) { ans++; rec[ans]=b;} //更新ans else if(b<rec[j+1]) rec[j+1]=b; //目前最长的子序列长度为ans,此外可以尽量让这ans个数变小,这样之后变长的可能性更大,感觉有点像贪心... break; } if(flag&&b<rec[1]) rec[1]=b; //如果它比前面所有数都小,那就看能不能更新第一个 } printf("%d\n",ans); } return 0;}
0 0
- POJ 2533 Longest Ordered Subsequence DP(LIS)
- POJ 2533 Longest Ordered Subsequence DP
- POJ 2533 Longest Ordered Subsequence 基础dp
- POJ 2533-Longest Ordered Subsequence(DP)
- poj 2533 Longest Ordered Subsequence(dp)
- poj 2533 Longest Ordered Subsequence dp
- DP-POJ-2533-Longest Ordered Subsequence
- poj 2533 Longest Ordered Subsequence(dp)
- poj 2533 Longest Ordered Subsequence 经典DP
- POJ 2533 Longest Ordered Subsequence(基础dp)
- [DP] POJ-2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence
- poj 2533Longest Ordered Subsequence
- poj 2533 Longest Ordered Subsequence
- Poj 2533 Longest Ordered Subsequence
- poj 2533 Longest Ordered Subsequence
- poj 2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence
- retiu234wy87478643
- P122 第14题 逆序
- 黑马程序员_StringBuffer和StringBuilder和几种排序以及查询算法
- chrome中强大的console
- 3ds43ssw
- poj 2533 Longest Ordered Subsequence dp
- ROS 学习系列 -- RViz中移动机器人来学习 URDF,TF,base_link, map,odom和odom 主题的关系
- Java基础第三讲
- errs2344213
- poj1328
- sksk732dsjkfh3t7826jea
- android 事件处理机制之requestDisallowInterceptTouchEvent
- jknkshiy786634
- wetsjk23748