CF_1506C Double-ended Strings（双头字符串）

Double-ended Strings（双头字符串）

链接

CF_1506C Double-ended Strings（双头字符串）

Description

if $|a|>0$ (the length of the string $a$ is greater than zero), delete the first character of the string $a$, that is, replace $a$ with $a2a3\dots an$;
if $|a|>0$, delete the last character of the string $a$, that is, replace $a$ with $a1a2\dots an-1$;
if $|b|>0$ (the length of the string $b$ is greater than zero), delete the first character of the string $b$, that is, replace $b$ with $b2b3\dots bn$;
if $|b|>0$, delete the last character of the string $b$, that is, replace $b$ with $b1b2\dots bn-1$.
Note that after each of the operations, the string a or b may become empty.

For example, if $a=\text{"}\text{h}\text{e}\text{l}\text{l}\text{o}\text{"}$ and $b=\text{"}\text{i}\text{c}\text{p}\text{c}\text{"}$, then you can apply the following sequence of operations:

delete the first character of the string $a\Rightarrow a=\text{"}\text{e}\text{l}\text{l}\text{o}\text{"}$ and $b=\text{"}\text{i}\text{c}\text{p}\text{c}\text{"}$;
delete the first character of the string $b\Rightarrow a=\text{"}\text{e}\text{l}\text{l}\text{o}\text{"}$ and $b=\text{"}\text{c}\text{p}\text{c}\text{"}$;
delete the first character of the string $b\Rightarrow a=\text{"}\text{e}\text{l}\text{l}\text{o}\text{"}$ and $b=\text{"}\text{p}\text{c}\text{"}$;
delete the last character of the string $a\Rightarrow a=\text{"}\text{e}\text{l}\text{l}\text{"}$ and $b=\text{"}\text{p}\text{c}\text{"}$;
delete the last character of the string $b\Rightarrow a=\text{"}\text{e}\text{l}\text{l}\text{"}$ and $b=\text{"}\text{p}\text{"}$.
For the given strings $a$ and $b$, find the minimum number of operations for which you can make the strings $a$ and $b$ equal. Note that empty strings are also equal.

Input

The first line contains a single integer $t(1\le t\le 100)$. Then $t$ test cases follow.

The first line of each test case contains the string $a(1\le |a|\le 20)$, consisting of lowercase Latin letters.

The second line of each test case contains the string $b(1\le |b|\le 20)$, consisting of lowercase Latin letters.

Output

For each test case, output the minimum number of operations that can make the strings $a$ and $b$ equal.

Example

Onput

5
a
a
abcd
bc
hello
codeforces
hello
helo
dhjakjsnasjhfksafasd
adjsnasjhfksvdafdser

Output

0
2
13
3
20

解析

实际上本题求的就是最长公共子串的长度。

我们可以用 $f_{i,j}$ 来表示字符串 $a$ 的第 $i$ 个字符与字符串 $b$ 的第 $j$ 个字符是否相等，若相等，$f_{i,j}=1$，若不等，$f_{i,j}=0$。最后我们再查找 $f$ 的中值为 $1$ 的最长的对角线的长度即为答案。

还有更简单的方程：
$$f_{i,j}=f_{i-1,j-1}+1$$

这样可以在计算 $f_{i,j}$ 的同时就求出答案。

代码

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
int n,f[21][21],ans;
string a,b;
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		ans=0;
		memset(f,0,sizeof(f));
		cin>>a>>b;
		for(int j=0;j<a.size();j++)
			for(int k=0;k<b.size();k++)
				if(a[j]==b[k])
				{
					f[j+1][k+1]=1+f[j][k];
					ans=max(ans,f[j+1][k+1]);
				}
		ans=a.size()+b.size()-2*ans;
		printf("%d\n",ans);
	}
	return 0;
}