AcWing 272. 最长公共上升子序列
原题链接
中等
作者:
George
,
2020-11-11 17:56:25
,
所有人可见
,
阅读 341
#include <iostream>
using namespace std;
int n;
int const N = 3010;
int a[N], b[N];
int f[N][N];
int main(){
scanf("%d", &n);
for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
for(int j = 1; j <= n; j++) scanf("%d", &b[j]);
// f[0][0] = 0;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++){
f[i][j] = f[i-1][j];
int maxv = 1;
if(a[i] == b[j]){
for(int k = 1; k < j; k++){
if(b[k] < b[j])
maxv = max(maxv, f[i-1][k]+1);
}
f[i][j] = max(f[i][j], maxv);
}
}
int res = 0;
for(int j = 1; j <= n; j++) res = max(res, f[n][j]);
printf("%d", res);
return 0;
}
#include <iostream>
using namespace std;
int n;
int const N = 3010;
int a[N], b[N];
int f[N][N];
int main(){
scanf("%d", &n);
for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
for(int j = 1; j <= n; j++) scanf("%d", &b[j]);
// f[0][0] = 0;
int maxv = 1;
for(int i = 1; i <= n; i++){
int maxv = 1;
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], maxv);
if(a[i] > b[j]) maxv = max(maxv, f[i-1][j]+1);
}
}
int res = 0;
for(int j = 1; j <= n; j++) res = max(res, f[n][j]);
printf("%d\n", res);
return 0;
}