POJ 2533 Longest Ordered Subsequence 动态规划
来源:互联网 发布:路由器限制视频端口 编辑:程序博客网 时间:2024/05/12 03:43
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>using namespace std;int max(int a,int b){return a>b?a:b;}int main(){int dp[1005],q[1005];int m,n,i,j,s;while(cin>>m){s=1;for(i=0;i<=m+1;i++){dp[i]=1; }for(i=1;i<=m;i++)cin>>q[i];dp[1]=1;for(i=2;i<=m;i++){for(j=1;j<i;j++)if(q[i]>q[j]){dp[i]=max(dp[j]+1,dp[i]); }if(dp[i]>s)s=dp[i];}cout<<s<<endl;}return 0;}
0 0
- POJ 2533-Longest Ordered Subsequence 动态规划
- POJ 2533 Longest Ordered Subsequence 动态规划
- POJ 2533 Longest Ordered Subsequence 动态规划
- POJ 2533 Longest Ordered Subsequence(DP动态规划)
- poj 动态规划DP - 2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence (DP动态规划)
- 动态规划【Longest Ordered Subsequence】
- 动态规划 Longest Ordered Subsequence
- POJ-2533-Longest Ordered Subsequence-最长递增子序列-动态规划
- //POj 2533 Longest Ordered Subsequence(动态规划:最长不减子序列)
- poj入门水题--动态规划(DP)2533 Longest Ordered Subsequence 1088滑雪
- Longest Ordered Subsequence 【poj-2533】【动态规划-最长上升子序列】
- acm pku 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
- 澤雷隨
- Cocos2d-X学习——Android不同设备FPS不同问题
- ZooKeeper安装与配置
- 数字时钟
- POJ 1798 Truck History
- POJ 2533 Longest Ordered Subsequence 动态规划
- Illustrator软件中eps和ai格式的区别
- [Leetcode] Evaluate Reverse Polish Notation 逆波兰表达式
- Bower:客户端库管理工具
- 一个空类,默认被填充了些什么?
- 向上转型
- 【ZooKeeper快速搭建
- Mac中鲜为人知的 Mac Tips
- 推荐一款移动开发必备的jQuery Mobile插件