POJ 3356 AGTC 最短编辑距离

Description

Let x and y be two strings over some finite alphabet A. We would like to transformx 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 inx is m and the number of letters in y is n wheren ≥ 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 stringx into a string y.

  最短编辑距离，比较初级的动态规划。

  有点坑的是，题目没有写多次输入，也有可能是我找了好几遍都没找到。

  借用一下别人的解释

题意：

由字符串 s1 通过下列三种操作

　1、插入一个字符；

   2、删除一个字符；

　3、改变一个字符

变换到字符串 s2 所需要的最少操作次数（亦即最短编辑距离问题）

解析：

第三届软件大赛决赛中关于核苷酸 变换的问题解析http://blog.csdn.net/kuaisuzhuceh/article/details/8680799如下（同样也适用于该题）；
状态转移方程：
有三种情况可以导致我们上面设计的状态会发生转移。我们现在来看A[i] 和 B[j] ，
①、我们可以在 B[j]后面插入一个核苷酸（即一个字符）ch，ch==A[i]，这样做的话，
至少需要 dp[i - 1][j] + 1步操作，即 dp[i][j] = dp[i - 1][j] + 1。
②、我们可以删除 B[j]，这样的话，B[1...j] 变为A[1...i] 需要 dp[i][j - 1]步，
即 dp[i][j] = dp[i][j - 1] + 1。
③、我们也可以考虑修改 B[j]，使它变为A[j]，但是如果 B[j]本来就等于 A[i]的话，
那修改其实相当于用了 0步，如果 B[j] != A[i] 的话，那修改相当于用了 1步。
所以 dp[i][j] = dp[i - 1][j - 1] + （A[i] == B[j] ? 0, 1）。

决策：
决策就很简单了，从上面三种状态转移中选择一个最小值就可以了。

处理边界：
处理好边界非常重要，这里需要注意的是对dp[0][0....m],dp[0.....n][0]的初始化，
可以这样看，dp[0][i],就是说A[1...n]是一个空串，而B[1...m]十个长度为i的串，
很显然B串变为A串就是删除i个核苷酸。

  上代码

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
using namespace std;

char c1[1005], c2[1005];
int n1, n2, dp[1005][1005];

int main()
{
	while(cin>>n1) {
		for(int i = 1; i <= n1; i++)
			cin>>c1[i];
		cin>>n2;
		for(int j = 1; j <= n2; j++)
			cin>>c2[j];
		
		for(int i = 1; i <= max(n1, n2); i++)
			dp[i][0] = dp[0][i] = i;
		
		for(int i = 1; i <= n1; i++)
			for(int j = 1; j <= n2; j++) {
				
				dp[i][j] = min(dp[i-1][j] + 1, dp[i][j-1] + 1);  
                if(c1[i] == c2[j])  
                    dp[i][j] = min(dp[i][j], dp[i-1][j-1]);  
                else  
                    dp[i][j] = min(dp[i][j], dp[i-1][j-1] + 1);
                    
			}
		
		cout<<dp[n1][n2]<<endl;
	}
	
	
	return 0;
}