hdu 1516 String Distance and Transform Process(编辑距离+保存修改路径)

http://acm.hdu.edu.cn/showproblem.php?pid=1516

还是编辑距离，这里要同时输出编辑过程。开始我以为只能正着输出编辑过程，dfs了很久，其实分别对两个字符串根据dp[i][j]的变化逆推回去就可以A。

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;

char s1[100],s2[100];
int dp[100][100];
int step;
int len1,len2;

void solve()
{
	memset(dp,0,sizeof(dp));
    for(int i = 0; i <= len1; i++)
        dp[i][0] = i;

    for(int i = 0; i <= len2; i++)
        dp[0][i] = i;


    for(int i = 1; i <= len1; i++)
    {
        for(int j = 1; j <= len2; j++)
        {
            if(s1[i-1] == s2[j-1])
                dp[i][j] = dp[i-1][j-1];

            else
               dp[i][j] = min(min(dp[i][j-1]+1, dp[i-1][j]+1),dp[i-1][j-1]+1);
        }
    }
}

void path()
{
    int tmp;
    int i,j;
    for(i = len1,j = len2;;)
    {
		if(i < 1 && j < 1)
			break;
        if(s1[i-1] == s2[j-1])
            tmp = 0;
        else tmp = 1;

        if(dp[i][j] == dp[i-1][j-1]+tmp && i >= 1 && j >= 1)
        {
            if(tmp)	//替换,i--,j--;
                printf("%d Replace %d,%c\n",++step,i,s2[j-1]);

            i--;
            j--;
        }
        else if(dp[i][j] == dp[i-1][j]+1 && i >= 1)//删除i，i--
        {
            printf("%d Delete %d\n",++step,i);
            i--;
        }
        else if(dp[i][j] == dp[i][j-1]+1 && j >= 1)//增加i+1处，j--
        {
            printf("%d Insert %d,%c\n",++step,i+1,s2[j-1]);
            j--;
        }
    }
}

int main()
{
    while(~scanf("%s %s",s1,s2))
    {
        len1 = strlen(s1);
        len2 = strlen(s2);
        solve();
		printf("%d\n",dp[len1][len2]);
		
        step = 0;
        path();
    }
    return 0;
}