[算法]求数组中最长递增子序列长度

int LIS(int* a, int n){
    int* maxV = new int[n+1];
    int* L = new int[n];
    maxV[1] = a[0];
    L[0] = 1;
    int maxLen = 1;
    for(int i = 1, j; i < n; ++i){
        L[i] = 1;
        for(j = maxLen; j >= 1; --j){
            if(maxV[j] < a[i]){
                L[i] = j+1;
                break;
            }
        }
        if(L[i] > maxLen){
            maxLen = L[i];
            maxV[maxLen] = a[i];
        }
        else{
            if(j >= 1 && maxV[j+1] > a[i]){
                maxV[j+1] = a[i];
            }
        }
        
    }
    delete[] maxV;
    delete[] L;
    return maxLen;
}