POJ 3903 Stock Exchange【LIS 二分查找】

Stock Exchange

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 5914		Accepted: 2072

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

Hint

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.

 

嗯，题意是求最长上升子序列，O(n^2)复杂度会超时吧，这里手写了二分查找。相当于把原序列中的数按顺序插入进去，取代其中第一个比它大或和它相等的数的位置上。

 

#include <iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#define maxn 100010
#define inf 0x3f3f3f3f
using namespace std;
int dp[maxn];
int num[maxn];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        for(int i=0;i<n;++i)
            scanf("%d",&num[i]);
        memset(dp,inf,sizeof(dp));
        num[n]=inf;
        for(int i=0;i<=n;++i)
        {
            int l=0,r=n,rec=0;
            while(l<=r)
            {
                int mid=(l+r)>>1;
                if(dp[mid]>=num[i])
                {
                    r=mid-1;
                    rec=mid;
                }
                else
                    l=mid+1;
            }
            dp[rec]=num[i];
            if(i==n)
            {
                printf("%d\n",rec);
                break;
            }
        }
    }
    return 0;
}