Longest Ordered Subsequence POJ

题意：最长上升子序列nlogn写法

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int dp[1005];
int a[1005];
int main(){
int n;
while(cin>>n){
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    memset(dp,0,sizeof(dp));
    dp[1]=a[0];
    int flag=1;
    for(int i=1;i<n;i++){
        int temp=lower_bound(dp,dp+flag,a[i])-dp;
        if(dp[flag]<a[i]){
         dp[++flag]=a[i];
       }
        else if(a[i]<dp[temp]){
            dp[temp]=a[i];
        }
    }
    cout<<flag<<endl;
}
return 0;
}