POJ 2533 Longest Ordered Subsequence
来源:互联网 发布:学编程的app 编辑:程序博客网 时间:2024/04/29 05:17
Longest Ordered Subsequence
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 25229 Accepted: 10957
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
最长上升子序列
#include <stdio.h>#include <math.h>#include <string.h>int a[1100],n;int main(){ int find(); int i,j,m,s,t,max; scanf("%d",&n); for(i=0;i<=n-1;i++) { scanf("%d",&a[i]); } max=find(); printf("%d\n",max); return 0;}int find(){ int i,j,dp[1100],max; memset(dp,0,sizeof(dp)); dp[0]=1; for(i=1;i<=n-1;i++) { max=0; for(j=0;j<=i-1;j++) { if(a[i]>a[j]) { if(dp[j]>max) { max=dp[j]; } } } dp[i]=max+1; } for(i=0,max=0;i<=n-1;i++) { if(dp[i]>max) { max=dp[i]; } } return max;}
- 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
- 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
- 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
- POJ 2533 Longest Ordered Subsequence
- Windows Azure IP RTM was released 9 days ago
- 在Linux下编译Windows版本的adb和fastboot
- Java程序开发流程(图文解说版)
- 我的C++成长之路(-) 学习阶段 -01
- mysql开启远程登录访问
- POJ 2533 Longest Ordered Subsequence
- wpa supplicant
- 【不严谨的NEXT函数陷阱】poj 1961——Period解题报告及反例一组
- java生成xml文件
- 数据库设计及命名规范http://blog.csdn.net/zhang_xinxiu/article/details/8521673
- 【linux】信号列表
- 如何关闭 Windows 7 的休眠功能,并删除 hiberfil.sys?
- Spring+Mybatis整合事务不起作用之解决方案汇总
- json 转换