poj - 2533 - Longest Ordered Subsequence(LIS)
2013-05-06 01:28
375 查看
题意:求最长递增子序列。
题目链接:http://poj.org/problem?id=2533
——>>……
woj - 1398 - Stock Exchange
题目链接:http://acm.whu.edu.cn/land/problem/detail?problem_id=1398
——>>两道题题意一样,不过这里的数量大了10倍,开始没改maxn,结果竟然是TLE,开多10倍的空间就AC啦~
hdu - 1257 - 最少拦截系统
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1257
——>>maxn改为30000 + 10~AC~
题目链接:http://poj.org/problem?id=2533
——>>……
woj - 1398 - Stock Exchange
题目链接:http://acm.whu.edu.cn/land/problem/detail?problem_id=1398
——>>两道题题意一样,不过这里的数量大了10倍,开始没改maxn,结果竟然是TLE,开多10倍的空间就AC啦~
hdu - 1257 - 最少拦截系统
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1257
——>>maxn改为30000 + 10~AC~
#include <cstdio> #include <algorithm> using namespace std; const int maxn = 10000 + 10; const int INF = 1000000000; int a[maxn], d[maxn], g[maxn]; int main() { int N, i; while(scanf("%d", &N) == 1) { int ret = -1; for(i = 1; i <= N; i++) scanf("%d", &a[i]); for(i = 1; i <= N; i++) g[i] = INF; for(i = 1; i <= N; i++) { int k = lower_bound(g+1, g+1+N, a[i]) - g; d[i] = k; g[k] = a[i]; ret = max(ret, k); } printf("%d\n", ret); } return 0; }
相关文章推荐
- poj 2533 Longest Ordered Subsequence(LIS(最长上升子序列))
- LIS(n^2) POJ 2533 Longest Ordered Subsequence
- POJ2533-Longest Ordered Subsequence(LIS)
- POJ 2533 Longest Ordered Subsequence(LIS)
- POJ-2533(LIS) Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence(最长非递减子序列,LIS)
- POJ:2533 Longest Ordered Subsequence(LIS-n*logn解法)
- 【dp-LIS】牛客网 --最长上升子序列 POJ 2533--Longest Ordered Subsequence(LIS模板题)
- POJ 2533 Longest Ordered Subsequence DP(LIS)
- POJ 2533 : Longest Ordered Subsequence - LIS问题
- POJ2533:Longest Ordered Subsequence(LIS)
- POJ 2533 Longest Ordered Subsequence(LIS)
- poj 2533 & poj 1631 Longest Ordered Subsequence( LIS果题 )
- POJ 2533 Longest Ordered Subsequence 二分查找(LIS nlogn算法)
- POJ 2533 Longest Ordered Subsequence (LIS)
- POJ 2533 Longest Ordered Subsequence(dp LIS)
- poj 2533 && zoj 2136 Longest Ordered Subsequence --- LIS模板
- 【POJ 2533】Longest Ordered Subsequence(最长上升子序列LIS)
- Longest Increasing Subsequence[LIS 最长上升子序列问题] (Longest Ordered Subsequence) POJ - 2533 队列优化
- [POJ 2533]Longest Ordered Subsequence[LIS]