最大上升子序列和最大下降子序列O(nlgn)复杂度

#include <iostream>
#include<algorithm>
using namespace std;


void Lis_inc(int a[],int n)
{

   int i,j;
   int *f = new int [n];

   for (i = 0;i < n; i++)
     f[i] = 0x3f3f3f3f;
   int len = 0;
   f[len] = a[0];

   for (i = 1;i < n; i++)
   {
       if (a[i] > f[len])
        {
            f[++len] = a[i];
            //cout << "len:" << len << endl;
        }
       else
        {
             j = lower_bound(f, f+n, a[i]) - f;
             //cout << "j:" << j << endl;
             f[j] = a[i];
        }
   }

     cout << len+1 << endl;
}

void Lis_dec(int a[],int n)
{

   int i,j;
   int *f = new int [n];

   for (i = 0;i < n; i++)
     f[i] = -999999;
   int len = 0;
   f[len] = a[0];

   for (i = 1;i < n; i++)
   {
       if (a[i] < f[len])
        {
            f[++len] = a[i];
            //cout << "len:" << len << endl;
        }
       else
        {
             j = upper_bound(f, f+n, a[i]) - f;
             //cout << "j:" << j << endl;
             f[j] = a[i];
        }
   }

     cout << len+1 << endl;
}
int main()
{
    int a[]={1,4,2,3,6,5,7};
    int b[]={9,8,6,4,2,3,1};
    Lis_inc(a,7);
    Lis_dec(b,7);
    return 0;
}