HDU 4604 Deque(最长上升子序)

题目链接

本来就对N*log(N)算法不大会....然后各种跪了，求出最长不下降+最长不上升-最少相同元素。求相同元素，用二分求上界搞的。代码里4个二分....

 #include <cstdio>
 #include <cstring>
 #include <iostream>
 #include <cmath>
 #include <algorithm>
 using namespace std;
 int d[];
 int dd[];
 int f[];
 int a[];
 int same[];
 int n;
 int bin1(int size,int x)
 {
     int l = ,r = size-,mid;
     while(l <= r)
     {
          mid = (l+r)/;
         if(x >= f[mid-]&&x < f[mid])
         return mid;
         else if(x < f[mid]) r = mid-;
         else l = mid + ;
     }
     return mid;
 }
 int binx(int size,int x)
 {
     int str = ,end = size-,mid;
     while(str < end)
     {
         mid = (str+end)/;
         if(f[mid] < x)
         str = mid + ;
         else
         end = mid;
     }
     return str;
 }
 void LIS1()
 {
     int i,j,size = ,k;
     f[] = a[];d[] = ;
     same[] = ;
     for(i = ;i < n;i ++)
     {
         if(a[i] < f[])
         {
             j = ;
             k = ;
         }
         else if(a[i] >= f[size-])
         {
             j = size ++;
             k = binx(size,a[i]);
         }
         else
         {
             j = bin1(size,a[i]);
             k = binx(size,a[i]);
         }
         f[j] = a[i];d[i] = j + ;
         same[i] = min(same[i],j-k+);
     }
 }
 int bin2(int size,int x)
 {
     int l = ,r = size-,mid;
     while(l <= r)
     {
         mid = (l+r)/;
         if(x <= f[mid-]&&x > f[mid])
         return mid;
         else if(x > f[mid]) r = mid-;
         else l = mid + ;
     }
     return mid;
 }
 int bins(int size,int x)
 {
     int str = ,end = size-,mid;
     while(str < end)
     {
         mid = (str+end)/;
         if(f[mid] > x)
         str = mid + ;
         else
         end = mid;
     }
     return str;
 }
 void LIS2()
 {
     int i,j,size = ,k;
     f[] = a[];d[] = ;
     same[] = ;
     for(i = ;i < n;i ++)
     {
         if(a[i] > f[])
         {
             j = ;
             k = ;
         }
         else if(a[i] <= f[size-])
         {
             j = size ++;
             k = bins(size,a[i]);
         }
         else
         {
             j = bin2(size,a[i]);
             k = bins(size,a[i]);
         }
         f[j] = a[i];d[i] = j + ;
         same[i] = min(same[i],j - k + );
     }
 }
 int main()
 {
     int t,i;
     scanf("%d",&t);
     while(t--)
     {
         scanf("%d",&n);
         for(i = ;i < n;i ++)
         {
             scanf("%d",&a[i]);
             same[i] = ;
         }
         for(i = ;i < n/;i ++)
         swap(a[i],a[n-i-]);
         memset(d,,sizeof(d));
         memset(f,,sizeof(f));
         LIS1();
         for(i = ;i < n;i ++)
         {
             dd[i] = d[i];
         }
         memset(d,,sizeof(d));
         memset(f,,sizeof(f));
         LIS2();
         int maxz = ;
         /*for(i = 0;i < n;i ++)
         {
             printf("%d ",dd[i]);
         }
         printf("\n");
         for(i = 0;i < n;i ++)
         {
             printf("%d ",d[i]);
         }
         printf("\n");
         for(i = 0;i < n;i ++)
         {
             printf("%d ",same[i]);
         }
         printf("\n");
         */
         for(i = ;i < n;i ++)
         maxz = max(maxz,dd[i]+d[i]-same[i]);
         printf("%d\n",maxz);
     }
     return ;
 }