poj 2533 Longest Ordered Subsequence
来源:互联网 发布:淘宝女装店铺介绍大全 编辑:程序博客网 时间:2024/04/28 18:37
Longest Ordered Subsequence
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 46180 Accepted: 20509
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
最大公共子串原题
#include <iostream>#include <cstdio>#include <cstring>using namespace std;int main(){ int n; int a[1005], dp[1005]; scanf("%d",&n); int i; for(i=0; i<n; i++) { scanf("%d", &a[i]); dp[i]=0; } dp[0]=1; int y=dp[0]; for(i=1; i<n; i++) { int j, ma=0; for(j=i-1; j>=0; j--) { if(a[j]<a[i] &&dp[j]>ma)ma=dp[j]; } dp[i]=ma+1;// printf("%d ", dp[i]); if(dp[i]>y)y=dp[i]; } printf("%d\n", y); return 0;}
0 0
- 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
- 程序员成长笔记-从软件工程师到项目经理
- 面试题总结 —— JAVA高级工程师
- Linux -Shell基础
- 单链表反转
- 小的总结
- poj 2533 Longest Ordered Subsequence
- 不接入sdk分享到第三方平台
- Android studio集成svn详细介绍
- spark-机器学习及SparkMLlib简介
- 《用tcp/ip进行网际互联》第9章 无分类和子网地址扩展(CIDR)
- Balanced Lineup(线段树)
- leetcode 328. Odd Even Linked List 16ms beats 96.25% c++
- 1.shell 编程(1) --- 简介
- day07_shutil模块学习