POJ2533:Longest Ordered Subsequence(LIS)
来源:互联网 发布:王者荣耀 芈月 知乎 编辑:程序博客网 时间:2024/05/21 20:07
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.
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
71 7 3 5 9 4 8
Sample Output
4
#include<cstdio>#include<iostream>#include<algorithm>#define N 1100using namespace std;int a[N],dp[N];int main(){ int n,i,j,maxx; maxx=1; cin>>n; for(i=1;i<=n;i++) { cin>>a[i]; dp[i]=1; } for(i=1;i<=n;i++) { for(j=1;j<i;j++) if(a[j]<a[i]) dp[i]=max(dp[i],dp[j]+1); maxx=max(dp[i],maxx); } cout<<maxx<<endl; return 0;}
0 0
- POJ2533:Longest Ordered Subsequence(LIS)
- POJ2533:Longest Ordered Subsequence(LIS)
- POJ2533-Longest Ordered Subsequence(LIS)
- POJ2533:Longest Ordered Subsequence(LIS) 动态规划
- POJ2533:Longest Ordered Subsequence
- POJ2533--Longest Ordered Subsequence
- poj2533 Longest Ordered Subsequence
- poj2533 Longest Ordered Subsequence
- poj2533 Longest Ordered Subsequence
- POJ2533:Longest Ordered Subsequence
- POJ2533---Longest Ordered Subsequence
- POJ2533:Longest Ordered Subsequence
- POJ2533-Longest Ordered Subsequence
- poj2533 Longest Ordered Subsequence
- POJ2533 Longest Ordered Subsequence
- POJ2533 Longest Ordered Subsequence
- POJ2533 Longest Ordered Subsequence
- POJ2533 Longest Ordered Subsequence
- ruby on rails 常用的日期取值
- gson解析json数组
- python-pandas绘图
- uva563
- codeforces 145E Lucky Queries
- POJ2533:Longest Ordered Subsequence(LIS)
- SQL注入
- Power of Two
- 使用Mybatis提供的mybatis generator来自动生成model/mapper.java/mapper.xml
- Cannot change version of project facet Dynamic web module to 2.5
- Android 性能优化之内存泄漏的检测与修复
- HDU1258 Sum It Up(DFS)
- (模板题)sdut 3374 数据结构实验之查找二:平衡二叉树(平衡二叉树的建立)
- Android内存泄漏分析及调试