You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
30 lines
634 B
30 lines
634 B
2 years ago
|
#include <bits/stdc++.h>
|
||
|
|
|
||
|
|
using namespace std;
|
||
|
|
const int N = 3010;
|
||
|
|
int a[N], b[N];
|
||
|
|
int f[N][N];
|
||
|
|
int res;
|
||
|
|
|
||
|
|
// O(n^2)
|
||
|
|
int main() {
|
||
|
|
int n;
|
||
|
|
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;
|
||
|
|
for (int j = 1; j <= n; j++) {
|
||
|
|
f[i][j] = f[i - 1][j];
|
||
|
|
if (a[i] == b[j]) f[i][j] = maxv;
|
||
|
|
if (a[i] > b[j]) maxv = max(maxv, f[i - 1][j] + 1);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
for (int i = 1; i <= n; i++) res = max(res, f[n][i]);
|
||
|
|
printf("%d\n", res);
|
||
|
|
|
||
|
|
return 0;
|
||
|
|
}
|