Longest Ordered Subsequence
来源:互联网 发布:linux下查看进程的方法 编辑:程序博客网 时间:2024/05/01 01:50
Longest Ordered Subsequence
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
- poj2553 Longest Ordered Subsequence
- 2533--Longest Ordered Subsequence
- Longest Ordered Subsequence
- longest ordered subsequence
- Longest Ordered Subsequence
- Longest Ordered Subsequence
- Longest Ordered Subsequence (P2533)
- POJ2533:Longest Ordered Subsequence
- POJ2533--Longest Ordered Subsequence
- poj2533 Longest Ordered Subsequence
- Longest Ordered Subsequence
- poj2533 Longest Ordered Subsequence
- poj2533 Longest Ordered Subsequence
- POJ2533:Longest Ordered Subsequence
- POJ2533---Longest Ordered Subsequence
- POJ2533:Longest Ordered Subsequence
- ZJU2136 Longest Ordered Subsequence
- POJ2533-Longest Ordered Subsequence
- xml-rpc和soap区别
- malloc 接口函数
- 关于Android下WIFI移植的一些指导文章
- Silverlight开发环境配置
- memcached简介
- Longest Ordered Subsequence
- JMS 传输和 SOAP 消息处理程序
- 性能结果分析与理解(关于90%响应时间、图表等)
- android通过MP3路径获取MP3的album
- Dreaming in code, Dreaming out reality.
- TinyOS-2.0在windows下的开发环境安装与配置
- 开源协议比较
- Jpage的用法详解
- Android学习日记