https://vijos.org/p/1111
LCS,(两个字符串的总长度 - 两个字符串求得的LCS)即为答案, 注意输入的字符是0开始的,而dp里0-1会越界错误,输入时不要把输入的字符指针指向a,而是指向a+1
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define ms(i,j) memset(i, j, sizeof(i));
using namespace std;
char a[105], b[105];
int f[105][105];
int main()
{
while (scanf("%s%s", a+1, b+1)==2)
{
ms(f,0);
int l1 = strlen(a+1), l2 = strlen(b+1);
for (int i=1;i<=l1;i++)
for (int j=1;j<=l2;j++)
{
if (a[i]==b[j]) f[i][j] = f[i-1][j-1]+1;
else f[i][j] = max(f[i-1][j], f[i][j-1]);
}
printf("%d\n", l1+l2-f[l1][l2]);
}
return 0;
}