原题跳转
朴素版:理解思路
#include<iostream>
#include<cstring>
using namespace std;
const int N = 3010;
int n;
int a[N], b[N];
int f[N][N];
int main()
{
cin>>n;
for(int i = 1; i <= n; i ++ ) cin>>a[i];
for(int i = 1; i <= n; i ++ ) cin>>b[i];
for(int i = 1; i <= n ; i ++ ){
for(int j = 1; j <= n; j ++ ){
f[i][j] = f[i - 1][j];
if(a[i] == b[j]){
f[i][j] = max(f[i][j], 1);
for(int k = 1; k < j; k ++ ){
if(b[k] < a[i]){
f[i][j] = max(f[i][j], f[i][k] + 1);
}
}
}
}
}
int res = 0;
for(int i = 1; i <= n; i ++ ){
res = max(res, f[n][i]);
}
cout<<res<<endl;
return 0;
}
优化版:
#include<bits/stdc++.h>
using namespace std;
const int N = 5200;
int n;
int res;
int a[N], b[N];
int f[N][N];
int main()
{
cin>>n;
for(int i = 1; i <= n; i ++ ){
cin>>a[i];
}
for(int i = 1; i <= n; i ++ ){
cin>>b[i];
}
for(int i = 1; i <= n; i ++ ){
int maxv = 1;//maxv用于记录前
for(int j = 1; j <= n; j ++ ){
f[i][j] = f[i - 1][j];
if(a[i] == b[j]) f[i][j] = max(maxv, f[i][j]);
if(b[j] < a[i]) maxv = max(maxv, f[i][j] + 1);
}
}
for(int i = 1; i <= n; i ++ ) res = max(res, f[n][i]);
cout<<res<<endl;
return 0;
}