POJ3903 5thweek.problem_e LIS

Description

The world financial crisis is quite a subject. Some people is more relaxed while others is quite anxious. John is one of the 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 the 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 is 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

Hint

There is 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. Topic Analysis: Still is to seek the longest ascending sub-sequence problem. Method with B-Question zoj1093. Remind yourself of the two aspects: 1. The subsequence does not require a continuous sequence. 2. Array out-of-bounds problem and less than equal trade-offs. The code is as follows:

1#include <iostream>2#include <cstdio>3 using namespacestd;4 intstock[100005],dp[100005];5 intMain ()6 {7     intN,i,k,left,right,mid;8    while(SCANF ("%d", &n)! =EOF)9   {Ten        for(i=0; i<n;i++) Onescanf"%d",&stock[i]); Adp[0]=-1; -k=0; -          for(i=0; i<n;i++) the         { -             if(stock[i]>Dp[k]) -dp[++k]=Stock[i]; -             Else +             { -left=1; +right=K; A                  while(left<=Right ) at               { -Mid= (left+right)/2; -                  if(stock[i]>Dp[mid]) -Left=mid+1; -                  Else -right=mid-1; in               } -dp[left]=Stock[i]; to             } +  -         } theprintf"%d\n", k); *   } $   return 0;Panax Notoginseng}

POJ3903 5thweek.problem_e LIS