最长上升子序列 +优化

最长上升子序列 + 优化

#include "iostream"

using namespace std;

const int N = 1010;

int a[N], f[N];

int main(){
    
    int n;
    cin >> n;
    for(int i = 1; i <= n; i ++)  cin >> a[i];
    
    for(int i = 1; i <= n; i ++){
        for(int j = 1; j < i; j ++)
           if(a[i] > a[j]) f[i] = max(f[i], f[j] + 1);
    }
    int res = 0;
    for(int i = 1; i <= n; i ++)  res = max(res, f[i]);
    
    cout << res + 1 <<endl;
    return 0;
    
}

下面是他的优化版本
维护单调栈注意这道题的数据范围

#include "iostream"

using namespace std;

const int N = 1e5 + 10;

int q[N], cnt; 
int a[N];

int find (int x, int n){
    
    int l = 1, r = n;
    while (l < r){
        int mid = (l + r + 1) >> 1;
        if (q[mid] < x) l = mid;
        else r = mid - 1;
    }
    return l;
    
}


int main (){
    
    int n;
    cin >>n;
    for (int i = 1; i <= n; i ++){
        scanf ("%d", &a[i]);
    }
    q[0] = -2e9;
    int res = 0;
    for (int i = 1; i <= n; i ++){
        
        int len = find (a[i], res);
        res = max(len + 1, res);
        q[len + 1] = a[i];
    }
    
    cout << res - 1<< endl;
    return 0;
}

下面还有一道题可以将最长公共子序列转化为最长上升子序列前提是（其中一个序列没有重复的元素）
利用下标来作为突破口

#include "iostream"
#include "cstring"
using namespace std;

const int N = 1e6 + 10;

int id[N], q[N];
int tt = 0;

int main (){
    
    int n;
    memset (id, -1, sizeof id);
    scanf ("%d", &n);
    for (int i = 0; i < n; i ++){
        int x;
        scanf ("%d", &x);
        id[x] = i;
    }
    
    q[0] = -1;
    for (int i = 0; i < n; i ++){
        int x;
        scanf ("%d", &x);
        if (id[x] == -1) continue;
        int l = 0, r = tt;
        while (l < r){
            int mid = (l + r + 1) >> 1;
            if (q[mid] < id[x]) l = mid;
            else r = mid - 1;
        }
        q[r + 1] = id[x];
        tt = max (tt, r + 1);
    }
    
    cout << tt << endl;
    return 0;
    
    
}