POJ-3903 Stock Exchange (lis longest ascending subsequence problem)

E-lisTime limit:1000MS Memory Limit:65536KB 64bit IO Format:%i64d &%i64 U

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. Puzzle: The longest ascending subsequence problem of Lis gives a sequence that selects as many integers as possible from left to right in order to form an ascending child Sequence.

#include<cstdio>int a[100001], F[100001];IntMain(){int nK, lR, mid;While(scanf("%d", &n)==1){For(int I=0; I< n; I++)scanf("%d", &a[I]); K=0; F[0]=-1; Assign the initial value, less than 0 canFor(int I=0; I< n; I++){If(A[I]> F[k]){k++; F[k]= A[I]; Save to F "" array for each one found}Else{L=1R= k;While(l<=r)//To determine the size of each value in the a[i] and f arrays until the optimal value is found{Mid=(l+ R)/2;If(A[I]> f[mid]) L = Mid + 1; else R = mid -1< Span class= "Sh-symbol" >;  F[l = A[i;  } printf (  "%d\n" ,k< Span class= "Sh-symbol"); }}          /span>                 

POJ-3903 Stock Exchange (lis longest ascending subsequence problem)