
Stock Exchange 
Time Limit: 3000ms, Special Time Limit:7500ms, Memory Limit:65536KB 
Total submit users: 19, Accepted users: 11 
Problem 10524 :
No special judgement

Problem description 
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},...,p_{n}
representing stock prices, a rising trend is a subsequence p_{i}1
< p_{i}2 < ， ， ， < p_{i}k, with i_{1} < i_{2}
< ， ， ， < i_{k}. John¨s problem is to find very quickly the
longest rising trend.

Input 
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 ＋ 100000) 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.

Output 
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.

Sample Input 
6
5 2 1 4 5 3
3
1 1 1
4
4 3 2 1

Sample Output 
3
1
1

Problem Source 
jiyanmoyu

Submit
Discuss
Judge Status
Problems
Ranklist

