最长公共子序列二分优化代码
时间: 2023-05-14 07:06:56 浏览: 77
以下是最长公共子序列二分优化代码的示例:
```
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1005;
int n, m, a[MAXN], b[MAXN], f[MAXN][MAXN];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (int i = 1; i <= m; i++) scanf("%d", &b[i]);
for (int i = 1; i <= n; i++) {
int l = 1, r = m, pos = -1;
while (l <= r) {
int mid = (l + r) >> 1;
if (b[mid] >= a[i]) {
pos = mid;
r = mid - 1;
} else {
l = mid + 1;
}
}
if (pos != -1) {
for (int j = pos; j <= m; j++) {
f[i][j] = max(f[i][j], f[i - 1][j - 1] + 1);
}
}
for (int j = 1; j <= m; j++) {
f[i][j] = max(f[i][j], f[i][j - 1]);
f[i][j] = max(f[i][j], f[i - 1][j]);
}
}
printf("%d\n", f[n][m]);
return 0;
}
```
希望能对你有所帮助!