POJ 2533 Longest Ordered Subsequence
2015-08-16 09:02
453 查看
http://poj.org/problem?id=2533
Longest Ordered Subsequence
Description
A numeric sequence of ai is ordered ifa1 <
a2 < ... < aN. Let the subsequence of the given numeric sequence (a1,a2, ...,
aN) be any sequence (ai1,ai2, ...,
aiK), where 1 <=i1 < i2 < ... <
iK <=N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8).
Your program, when given the numeric sequence, must find the length of its longest ordered subsequence.
Input
The first line of input file contains the length of sequence N. The second line contains the elements of sequence - N integers in the range from 0 to 10000 each, separated by spaces. 1 <= N <= 1000
Output
Output file must contain a single integer - the length of the longest ordered subsequence of the given sequence.
Sample Input
Sample Output
题意:求一个严格单调上升子序列的最大长度
解题思路:维护一个单调的队列
新的元素,如果大于队尾元素,即插入队尾
否则二分查找比它大的最小元素,替换掉
最后队列长度即为LIS的解
复杂度分析: 时间复杂度:o(n*logn)
空间复杂度:o(n)
Longest Ordered Subsequence
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 39104 | Accepted: 17188 |
A numeric sequence of ai is ordered ifa1 <
a2 < ... < aN. Let the subsequence of the given numeric sequence (a1,a2, ...,
aN) be any sequence (ai1,ai2, ...,
aiK), where 1 <=i1 < i2 < ... <
iK <=N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8).
Your program, when given the numeric sequence, must find the length of its longest ordered subsequence.
Input
The first line of input file contains the length of sequence N. The second line contains the elements of sequence - N integers in the range from 0 to 10000 each, separated by spaces. 1 <= N <= 1000
Output
Output file must contain a single integer - the length of the longest ordered subsequence of the given sequence.
Sample Input
7 1 7 3 5 9 4 8
Sample Output
4
题意:求一个严格单调上升子序列的最大长度
解题思路:维护一个单调的队列
新的元素,如果大于队尾元素,即插入队尾
否则二分查找比它大的最小元素,替换掉
最后队列长度即为LIS的解
复杂度分析: 时间复杂度:o(n*logn)
空间复杂度:o(n)
#include<iostream> #include<cstdio> using namespace std; const int maxn=10010; int a[maxn],b[maxn]; int n; int w(int *a,int x,int y,int t) { int L=x,R=y,M=0; while(L<R) { M=((R-L)>>1)+L; if(a[M]<t) L=M+1; else R=M; } return L; } int main() { while(cin>>n && n) { int t,c=1; cin>>b[0]; for(int i=1;i<n;i++) { cin>>t; if(t>b[c-1]) b[c++]=t; else b[w(b,0,c,t)]=t; } cout << c << endl; } return 0; }
相关文章推荐
- Havok_2014-1-0_Pc_Xs_User_Guide(2.5.1-Character Control)
- 子线程更新UI的方法与解析!
- Android基础UI篇------TextView及其子类
- Codeforces Round #316 (Div. 2) D. Tree Requests dfs_clock,二分
- 从UE4开始蜕变
- POJ - 1904 King's Quest(强连通分量+二分图匹配)
- poi Build path 配置,顺序问题
- 解决PHPCMS使用ueditor时缩略图上传问题
- UEditor使用技巧(2):自定义样式
- 百度Ueditor编辑器的Html模式自动替换样式的解决方法
- 空中网面试题二SynchronousQueue
- poj 1947 Rebuilding Roads 树形dp
- UIButton和UIImageView的区别一
- iOS开发UI篇—核心动画(UIView封装动画)
- pat(A) 1007. Maximum Subsequence Sum(和最大子段)
- HDU 1005.Number Sequence【很多问题是不能直接求的】【8月15】
- codeforces#FF DIV2C题DZY Loves Sequences(DP)
- HDU 2227 Find the nondecreasing subsequences
- 刀哥多线程全局队列gcd-09-global_queue
- zoj 2672 Fibonacci Subsequence(hash + dp)