POJ2533(LIS)
来源:互联网 发布:程序员创业项目 编辑:程序博客网 时间:2024/05/17 20:28
Longest Ordered Subsequence
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 46120 Accepted: 20476
Description
A numeric sequence of ai is ordered if a1 < 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
Source
Northeastern Europe 2002, Far-Eastern Subregion
LIS模板题
#include "cstring"#include "cstdio"#include "string.h"#include "iostream"using namespace std;int a[1005];int dp[1005];int main(){ int n; while(~scanf("%d",&n)) { for(int i=1;i<=n;i++) scanf("%d",&a[i]); memset(dp,0,sizeof(dp)); dp[1]=a[1]; int len=1; for(int i=2;i<=n;i++) { if(dp[len]<a[i]) { dp[++len]=a[i]; } else { int left=1,right=len,mid; while(left<=right) { mid=(left+right)/2; if(dp[mid]<a[i]) { left=mid+1; } else right=mid-1; } dp[left]=a[i]; } } printf("%d\n",len); } return 0;}
- poj2533--LIS
- poj2533(LIS)
- poj2533 LIS
- POJ2533(LIS)
- poj2533 简单DP LIS
- POJ2533 LIS模板题
- poj2533,LIS问题(n^2)
- POJ2533:Longest Ordered Subsequence(LIS)
- POJ2533:Longest Ordered Subsequence(LIS)
- POJ2533-Longest Ordered Subsequence(LIS)
- POJ2533:Longest Ordered Subsequence(LIS) 动态规划
- poj2533
- POJ2533
- poj2533
- poj2533
- poj2533
- POJ2533
- poj2533
- javaScript操作cookie
- 多进程并发编程--消息传递服务器
- latex公式导出word(docx)实例
- 小米笔试题-小米Git
- MSTest 无法退出
- POJ2533(LIS)
- Python学习3--返回函数 、匿名函数、装饰器、偏函数
- 屏幕录像工具之屏幕截图
- 前端小技巧
- 精通C#:Chapter5 封装-学习笔记
- android异常——NoClassDefFoundError
- POJ2481->树状数组
- Intent
- file_get_contents("php://input")的使用方法