`
thecloud
  • 浏览: 872262 次
文章分类
社区版块
存档分类
最新评论

POJ 2533 Longest Ordered Subsequence 典型LIS

 
阅读更多

http://poj.org/problem?id=2533

Longest Ordered Subsequence
Time Limit:2000MS Memory Limit:65536K



Description

A numeric sequence ofaiis ordered ifa1<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

7
1 7 3 5 9 4 8

Sample Output

4

分享到:
评论

相关推荐

Global site tag (gtag.js) - Google Analytics