POJ 2533 Longest Ordered Subsequence

来源：互联网发布：七匹狼授权淘宝网店编辑：程序博客网时间：2024/06/06 13:14

题目

总时间限制: 2000ms 内存限制: 65536kB
描述
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.
输入
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 file must contain a single integer - the length of the longest ordered subsequence of the given sequence.
样例输入
7
1 7 3 5 9 4 8
样例输出
4
来源
Northeastern Europe 2002, Far-Eastern Subregion

思路

动态规划。maxlen(k)表示以ak为终点的最长上升子序列长度.

m a x l e n (1) = 1 m a x l e n (k) = M a x {m a x l e n (i) : 1 < i < k a n d a i < a k a n d k \neq 1} + 1

阅读全文

0 0

七匹狼授权淘宝网店

原创粉丝点击

热门问题 老师的惩罚人脸识别我在镇武司摸鱼那些年重生之率土为王我在大康的咸鱼生活盘龙之生命进化天生仙种凡人之先天五行春回大明朝姑娘不必设防，我是瞎子全国小学生广播体七彩阳光七律长征七律七律到韶山长征七律七律南京七律长征诗七律登庐山七律有所思七律长佂七律古诗七律冬云七律100首七律格律到韶山七律七律答友人登庐山七律七律平仄七律.无题七律长佂诗句七律长征全诗七律长征意思七律长征诗意七律长征的意思七律长征古诗七律长征朗诵七律长佂诗句朗诵七律长佂诗意七律长征地名七律长征诗眼七律长征教案七律长征赏析七律长征教学反思七律长佂诗句解说七律和柳亚子先生七律长征的诗意七律长征反思七律长征教学设计七律长征拼音七律长征地名排序七律长征写作背景