Period UVA - 1371

动态规划，依次从源字符串的每个字符开始进行相应的匹配计算，在判断的时候利用二分法来提高查找效率即可，     dp[i][j]表示的是1~i个源字符匹配到目标字符j的最大的编辑次数，同时在状态转换的时候相似于LCS，具体实现见如下代码：

#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<deque>
using namespace std;

class Solve{
public:
	char y[55], x[5050];
	const int Inf = 0x3f3f3f3f;
	int n, m;
    int dp[5050][55];

	bool DP(int amount){
		
		memset(dp,Inf,sizeof(dp));
		dp[0][0] = 0;
		for (int i = 0; i <= n; i++){
			if (dp[i][m] <= amount) dp[i][0] = 0;
			for (int j = 0; j <= m; j++){
					if (dp[i][j] > amount) continue;
					dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j] + (x[i+1] == y[j+1] ? 0 : 1));
					dp[i + 1][j] = min(dp[i+1][j],dp[i][j]+1);
					dp[i][j + 1] = min(dp[i][j + 1], dp[i][j] + 1);
				}
			}
		return dp[n][m] <= amount;
	}

	void Deal(){
		n = strlen(x + 1);
		m = strlen(y + 1);
		int left = 0, right = m;
		while (left < right){
			int amount = (left + right) / 2;
			if (DP(amount)) right = amount;
			else left = amount+1;
		}
		printf("%d\n",left);
	}
};

int main(){
	Solve a;
	int t;
	scanf("%d",&t);
	while (t--){
		scanf("%s%s", a.y+1, a.x+1);
		a.Deal();
	}
	return 0;
}