Problem #2743 - ECNU Online Judge

单点时限: 5.0 sec

内存限制: 256 MB

The world financial crisis is quite a subject. Some people are more relaxed while others are quite anxious. John is one of them. He is very concerned about the evolution of the stock exchange. He follows stock prices every day looking for rising trends. Given a sequence of numbers $p_{1}, p_{2}, \dots, p_{n}$ . representing stock prices, a rising trend is a subsequence $p_{i_{1}} < p_{i_{2}} < \dots < p_{i_{k}}$ , with $i_{1} < i_{2} < \dots < i_{k}$ . John’s problem is to find very quickly the longest rising trend.

输入格式

The program input is from a text file. Each data set in the file stands for a particular set of stock prices. A data set starts with the length $L$ $(L \leq 100 000)$ of the sequence of numbers, followed by the numbers (a number fits a long integer). The program prints the length of the longest rising trend.

输出格式

White spaces can occur freely in the input. The input data are correct and terminate with an end of file. For each set of data the program prints the result to the standard output from the beginning of a line. An input/output sample is in the table bellow. There are three data sets. In the first case, the length $L$ of the sequence is $6$ . The sequence is $5, 2, 1, 4, 5, 3$ . The result for the data set is the length of the longest rising trend: $3$ .

样例

Input

6
5 2 1 4 5 3
3
1 1 1
4
4 3 2 1

Output

3
1
1

35 人解决，43 人已尝试。

44 份提交通过，共有 171 份提交。

4.3 EMB 奖励。

创建: 15 年，6 月前.

修改: 7 年，6 月前.

最后提交: 1 年，9 月前.

来源: Southeastern European Regional Programming Contest 2008

DP

2743. Stock Exchange

输入格式

输出格式

样例

服务

开源

关于我们