POJ 2533 Longest Ordered Subsequence DP
来源:互联网 发布:tsis交通仿真软件 编辑:程序博客网 时间:2024/06/06 00:02
Longest Ordered Subsequence
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 32192 Accepted: 14093
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<iostream>#include<cstring>using namespace std;int main(){int n;while(cin>>n){int a[1005],b[1005];memset(b,0,sizeof(b));int i,j;for(i=0;i<n;i++)cin>>a[i];for(i=0;i<n;i++){b[i]=1;for(j=0;j<i;j++)if(a[j]<a[i]&&b[i]<b[j]+1)b[i]++;}int max=0;for(i=0;i<n;i++)if(max<b[i]) max=b[i];cout<<max<<endl;}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
- 在linux中配置安装telnet服务
- linux设置命令的环境变量
- ios开发中数据库读取数据牵涉到的日期处理:前一天、今天、后天、一周等
- 【Unity 3D】学习笔记三十八:角色控制器
- POJ 1631 Bridging signals
- POJ 2533 Longest Ordered Subsequence DP
- 加载lib文件技巧
- poj 2503 Babelfish
- 【ACM训练计划】POJ 题目分类 【初级、中级、高级】
- 组合数模版 整理
- scanf("%*d");
- 迪杰斯特拉--- 模板(求最短路径/输出路径/所有路径都可以走的做法)
- 最大概率法分词及性能测试
- Struts2如何传值到jsp页面