POJ2533 Longest Ordered Subsequence

Longest Ordered Subsequence

Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 46578 Accepted: 20668
Description

A numeric sequence of ai is ordered if a1 < a2 < … < aN. Let the subsequence of the given numeric sequence (a1, a2, …, aN) be any sequence (ai1, ai2, …, aiK), where 1 <= i1 < i2 < … < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8).

Your program, when given the numeric sequence, must find the length of its longest ordered subsequence.
Input

The first line of input file contains the length of sequence N. The second line contains the elements of sequence - N integers in the range from 0 to 10000 each, separated by spaces. 1 <= N <= 1000
Output

Output file must contain a single integer - the length of the longest ordered subsequence of the given sequence.
Sample Input

7
1 7 3 5 9 4 8

Sample Output

4

代码：复杂度为O（nlogn）

---

#include<stdio.h>
#include<math.h>
#include<vector>
#include<algorithm>
#include<string.h>
#include<stdlib.h>
#include<iostream>
#include<stack>
#include<queue>
using namespace std;
const int maxn=100000+10;
int a[maxn],b[maxn];
int Search(int num,int low,int high)
{
    int mid;
    while(low<=high)
    {
        mid=(low+high)/2;
        if(num>b[mid])
        {
            low=mid+1;
        }
        else
            high=mid-1;
    }
    return low;
}
int DP(int n)
{
    int i,len,pos;
    b[1]=a[1];
    len=1;
    for(int i=2; i<=n; i++)
    {
        if(a[i]>b[len])
        {
            len=len+1;
            b[len]=a[i];
        }
        else
        {
            pos=lower_bound(b+1,b+len+1,a[i])-b;//也可以写成 pos=Search(a[i],1,len);

            b[pos]=a[i];
        }
    }
    return len;
}
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1; i<=n; i++)
    {
        scanf("%d",&a[i]);
    }
    int ans=DP(n);
    printf("%d\n",ans);
}