动态规划——C编辑最短距离

C - 编辑距离

时间限制: 1000女士 内存限制: 65536KB 64位输入输出格式: %I64d & %I64u

提交 状态

描述

Let x and y be two strings over some finite alphabet A. We would like to transform x into y allowing only operations given below:

• Deletion: a letter in x is missing in y at a corresponding position.
• Insertion: a letter in y is missing in x at a corresponding position.
• Change: letters at corresponding positions are distinct

Certainly, we would like to minimize the number of all possible operations.

Illustration

A G T A A G T * A G G C 
| | |       |   |   | |

A G T * C * T G A C G C

Deletion: * in the bottom line 
Insertion: * in the top line 
Change: when the letters at the top and bottom are distinct

This tells us that to transform x = AGTCTGACGC into y = AGTAAGTAGGC we would be required to perform 5 operations (2 changes, 2 deletions and 1 insertion). If we want to minimize the number operations, we should do it like

A  G  T  A  A  G  T  A  G  G  C 
|  |  |        |     |     |  |

A  G  T  C  T  G  *  A  C  G  C

and 4 moves would be required (3 changes and 1 deletion).

In this problem we would always consider strings x and y to be fixed, such that the number of letters in x is m and the number of letters in yis n where n ≥ m.

Assign 1 as the cost of an operation performed. Otherwise, assign 0 if there is no operation performed.

Write a program that would minimize the number of possible operations to transform any string x into a string y.

Input

The input consists of the strings x and y prefixed by their respective lengths, which are within 1000.

Output

An integer representing the minimum number of possible operations to transform any string x into a string y.

Sample Input

10 AGTCTGACGC
11 AGTAAGTAGGC

Sample Output

4
题目大意： 给出两个字符串X,Y，求出从X——>Y的最小操作次数，只可以删除，添加，修改一个字符。
解题思路：

也是DP中比较经典的问题

d[i][j]表示第一个串到i位置，和第二个串到j位置的最短编辑距离

d[i][j]

如果a[i]==b[j]

d[i][j]=min(d[i-1][j-1],d[i-1][j]+1,d[i][j-1]);

否则d[i][j]=min(d[i-1][j-1]+1,d[i-1][j]+1,d[i][j-1]);

程序代码：

 #include <cstdio>
 #include <iostream>
 using namespace std;
 const int M=;
 char a[M],b[M] ;
 int d[M][M];
 int main()
 {
     int n,i,j,l,r;
    while( scanf("%d%s",&l,a+)!=EOF)
    {
     scanf("%d%s",&r,b+);
    int len=max(l,r);
     for(i=;i<=len;i++)
        {
            d[i][]=i;
            d[][i]=i;
        }
     for(i=;i<=l;i++)
         for(j=;j<=r;j++)
         {
             d[i][j]=min(d[i-][j]+,d[i][j-]+);
             if(a[i]==b[j])
                 d[i][j]=d[i-][j-];
             else
                 d[i][j]=min(d[i][j],d[i-][j-]+);
         }
          printf("%d\n",d[l][r]);
    }
     return ;
 }