#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define debug(x) cout << #x << " -> " << x << endl
using i64 = long long;
using namespace std;
constexpr int N = 200 + 10, INF = 0x7f7f7f7f;
int n, k;
// 最小生成树
struct node {
int a, b, w;
bool operator<(const node &y) const { return w < y.w; }
} g[N * N];
int p[N];
int find(int x) { return x == p[x] ? x : p[x] = find(p[x]); }
int idx;
int l[N];
char s[N][N];
int kruskal() {
for (int i = 1; i <= n + 1; i++)
p[i] = i;
sort(g + 1, g + 1 + idx);
int res = 0;
for (int i = 1; i <= idx; i++) {
int a = g[i].a, b = g[i].b, w = g[i].w;
int fa = find(a), fb = find(b);
if (fa != fb) {
p[fb] = fa;
res += w;
}
}
return res;
}
// 求两个字符串的LCS
// 并算出aa -> bb 所需要的代价
int get(char *aa, char *bb, int lena, int lenb) {
vector<vector<int>> f(lena + 1, vector<int>(lenb + 1));
for (int i = 1; i <= lena; i++)
for (int j = 1; j <= lenb; j++) {
f[i][j] = max(f[i - 1][j], f[i][j - 1]);
if (aa[i] == bb[j])
f[i][j] = max(f[i][j], f[i - 1][j - 1] + 1);
}
return k + lena + lenb - f[lena][lenb] * 2;
}
int main() {
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%d", &l[i]);
scanf("%s", s[i] + 1);
for (int j = 1; j < i; j++) {
int w = get(s[i], s[j], l[i], l[j]);
g[++idx] = {i, j, w};
}
// 0表示虚点,也就是直接打出原字符串的代价
g[++idx] = {i, 0, l[i]};
}
printf("%d", kruskal());
return 0;
}
2022陕西省赛 C-Type The Strings(最小生成树)
最新推荐文章于 2024-10-06 10:17:48 发布
该代码实现了一个程序,它使用Kruskal算法找到字符串编辑距离的最小代价,同时涉及最长公共子序列(LCS)计算。程序首先构建边权重表示字符串之间的转换代价,然后通过最小生成树找出总代价最小的编辑路径。
摘要由CSDN通过智能技术生成