POJ2533 Longest Ordered Subsequence (动态规划)
来源:互联网 发布:阿里云 杰出 科学家 编辑:程序博客网 时间:2024/06/11 05:05
Longest Ordered Subsequence
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 49547 Accepted: 21994
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.
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
Source
Northeastern Europe 2002, Far-Eastern Subregion
思路:求序列的最长递增子序列即可,状态转移方程:dp[i] = max(dp[i],dp[j]+1);
#include <cstdio>#include <iostream>#include <cstring>#include <cmath>#include <algorithm>using namespace std;int a[1005],dp[1005];int main(){int n;cin >> n;for(int i = 0; i < n; i ++)scanf("%d",&a[i]);for(int i = 0; i < n; i ++){dp[i] = 1;}for(int i = 1; i < n; i ++)for(int j = 0; j < i; j ++)if(a[i] > a[j])dp[i] = max(dp[i],dp[j] + 1);int Max = 0;for(int i = 0; i < n; i ++)Max = max(Max,dp[i]);printf("%d\n",Max);return 0;}
0 0
- POJ2533 Longest Ordered Subsequence (动态规划)
- 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
- 【POJ2533】Longest Ordered Subsequence
- poj2533 Longest Ordered Subsequence
- 第三章-MFC运行机制
- 程序(位操作)
- express的application.js里的路由代码
- HDU 1969 高精度
- 数据与运营--4个层面系统梳理,实实在在解决问题
- POJ2533 Longest Ordered Subsequence (动态规划)
- 专题7-ARM时钟初始化
- 3D游戏引擎系列十一
- 理解linux time命令的输出
- 指针函数的返回
- Mysql函数INSTR、LOCATE、POSITION VS LIKE
- Android Handler消息处理机制 一些事一些情
- for 续3
- gradle项目中如何支持java与scala混合使用?