hdu 1025 n*logn最长上升子序列

 /*
 TLE
 */
 #include <iostream>
 #include <cstdio>
 #include <cstring>
 using namespace std;

 const int maxn=5e5+;
 int a[maxn],b[maxn],c[maxn],f[maxn<<];
 inline int max(int a,int b){return a>b?a:b;}
 void swap(int &a,int &b){int t=a;a=b;b=t;}
 void qsort(int l,int r)
 {
     if(l<r)
     {
         int key=b[l],i=l,j=r;
         while(i!=j)
         {
             while(b[j]>=key && i<j) j--;
             while(b[i]<=key && i<j) i++;
             if(i<j) swap(b[i],b[j]);
         }
         b[l]=b[i];b[i]=key;
         qsort(l,i-);
         qsort(i+,r);
     }
 }
 int binary_search(int l,int r,int val)
 {
     int mid;
     while(l<=r)
     {
         mid=(l+r)>>;
         if(c[mid]>val) r=mid-;
         else if(c[mid]==val) return mid;
         else l=mid+;
     }
     return -;
 }
 void updata(int pos,int v,int l,int r,int rt)
 {
     if(l==r)
     {
         f[rt]=v;return;
     }
     int mid=(l+r)>>;
     if(pos<=mid) updata(pos,v,l,mid,rt<<);
     else updata(pos,v,mid+,r,rt<<|);
 }
 int query(int L,int R,int l,int r,int rt)
 {
     if(L<=l && r<=R)
         return f[rt];
     int mid=(l+r)>>;
     int ans;
     if(L<=mid) ans=query(L,R,l,mid,rt<<);
     if(R>mid) ans=max(ans,query(L,R,mid+,r,rt<<|));
     return ans;
 }
 int main()
 {
     int icase=,n,tmp,i,cnt;
     while(~scanf("%d",&n))
     {
         for(i=;i<=n;i++)
         {
             scanf("%d%d",&tmp,a+i);b[i]=a[i];
         }
         qsort(,n);cnt=;c[]=b[];
         for(i=;i<=n;i++)
             if(b[i]!=b[i-])
                 c[++cnt]=b[i];
         memset(f,,sizeof(f));
         int ans=,maxv,x;
         for(i=;i<=n;i++)
         {
             x=binary_search(,cnt,a[i]);
             if(x>) maxv=query(,x-,,cnt,);
             else maxv=;
             updata(x,maxv+,,cnt,);
             if(maxv+>ans) ans=maxv+;
         }
         printf("Case %d:\n",++icase);
         if(ans==) printf("My king, at most 1 road can be built.\n\n");
         else printf("My king, at most %d roads can be built.\n\n",ans);
     }
     return ;
 }
 /*
 2
 1 2
 2 1
 3
 1 2
 2 3
 3 1
 */

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 using namespace std;

 const int maxn=5e+;
 int dp[maxn],f[maxn];

 int upper_bound(int l,int r,int val)//二分求上界
 {
     int mid,ans=-;
     while(l<=r)
     {
         mid=(l+r)>>;
         if(dp[mid]>=val) ans=mid,r=mid-;
         else l=mid+;
     }
     return ans;
 }

 int main()
 {
     int icase=,n,i,cnt,x,y;
     while(~scanf("%d",&n))
     {
         for(i=;i<=n;i++)
         {
             scanf("%d%d",&x,&y);
             f[x]=y;
         }
         dp[]=f[];cnt=;
         for(i=;i<=n;i++)
         {
             x=upper_bound(,cnt,f[i]);
             if(x==-) dp[++cnt]=f[i];
             else dp[x]=f[i];
         }
         printf("Case %d:\n",++icase);
         if(cnt==) printf("My king, at most 1 road can be built.\n\n");
         else printf("My king, at most %d roads can be built.\n\n",cnt);
     }
     return ;
 }