Longest Ordered Subsequence ||POJ2533
来源:互联网 发布:魔兽1.12数据库 声望 编辑:程序博客网 时间:2024/05/21 10:59
题目链接:http://poj.org/problem?id=2533
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
71 7 3 5 9 4 8
Sample Output
4
题解:注意样例:输出是4,那么符合要求的序列有1 3 5 9;1 3 5 8;1 3 4 8,我的算法是选出1 3 5 9,因为9 比后两个都大,不符合算法要求
动态规划,逐步理解
#include<cstdio>#include<cstdlib>#include<cstring>#include<cmath>#include<iostream>#include<algorithm>using namespace std;int a[1010],dp[1010],n;int LIS(){ int i,j,ans,m; ans=1; dp[1]=1; for(i=2;i<=n;i++) { m=0; for(j=1;j<i;j++) { if(dp[j]>m&&a[j]<a[i]) { m=dp[j]; } } dp[i]=m+1; if(dp[i]>ans) ans=dp[i]; }return ans;} int main(){ int i; while(~scanf("%d",&n)) { for(i=1;i<=n;i++) { scanf("%d",&a[i]); } printf("%d\n",LIS()); }return 0;}
阅读全文
0 0
- 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
- Longest Ordered Subsequence ||POJ2533
- POJ2533 : Longest Ordered Subsequence
- 利用JS制作万年历
- hdu 5668 中国剩余定理(模版)
- 食物链(POJ
- 百度地图
- 默认构造参数
- Longest Ordered Subsequence ||POJ2533
- 剑指offer--删除链表中重复的结点
- SSL certificate problem: unable to get local issuer certificate
- 动态规划之多重背包
- 二叉树的宽度
- HDU 2444 The Accomodation of Students (二分图匹配+匈牙利算法+bfs判断是否为二分图)
- 大端模式、小端模式及其在Qt中的转换
- makefile作用
- ST表模板(维护区间最大值)