Stock Exchange+POJ+最长升子序列n*log（n）算法

Stock Exchange

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 4271		Accepted: 1525

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 p1, p2,...,pn representing stock prices, a rising trend is a subsequence pi1 < pi2 < ... < pik, with i1 < i2 < ... < ik. John’s problem is to find very quickly the longest rising trend.

Input

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). 
White spaces can occur freely in the input. The input data are correct and terminate with an end of file.

Output

The program prints the length of the longest rising trend. 
For each set of data the program prints the result to the standard output from the beginning of a line.

Sample Input

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

Sample Output

3 
1 
1

解决方案：
 
 
 

  
  
  最长递增子序列，Longest Increasing Subsequence 下面我们简记为 LIS。
 
 
 
 
 
 

  
  
  排序+LCS算法 以及 DP算法就忽略了，这两个太容易理解了。
 
 
 
 
 
 

  
  
   
 
 
 
 
 
 

  
  
  假设存在一个序列d[1..9] = 2 1 5 3 6 4 8 9 7，可以看出来它的LIS长度为5。