Longest Ordered Subsequence POJ - 2533 最长上升子序列dp

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

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 using namespace std;
 int dp[];
 int a[];
 int main(){
 int n;
 while(cin>>n){
     for(int i=;i<n;i++){
         cin>>a[i];
     }
     memset(dp,,sizeof(dp));
     dp[]=a[];
     int flag=;
     for(int i=;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 ;
 }