一个是O(n^2)一个是O(logn*n)

两者都需要临时空间

#include 
    
     using namespace std;//time complex:n^nint longest_increase_sequence(int a[], int n){    if(n==1)        return n;    int b[n];    int i,j;    int tmp, result=1;    b[0] = 1;    for(i=1;i
     
      =tmp&&a[j]<=a[i])                tmp = b[j] +1;        }        b[i] = tmp;        if(b[i]>result)            result = b[i];    }    return result;}//length increased return truebool binary_replace(int a[], int n, int val){    if(n==0)    {        a[0] = val;        return true;    }    int i;    for(i=0;i
      
       val)        {            a[i] = val;            return false;        }    }    if(i==n)    {        a[n] = val;        return true;    }}int longest_increase_sequence2(int a[], int n){    if(n<=1)        return n;    int b[n];    int result = 1;    int len = 1;    b[0] = a[0];    for(int i=1;i
       
        >n)    {        for(int i=0;i
        
         >a[i];        cout<
         
          <