动态规划——AGTC

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 y is 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

题意：给了两个串， 求将一个串转化为另一个串所需要的最小步数，每一步可以进行添加，删除， 改变这三种中的其中一种操作

思路：设置dp[i][j],表示将s1中前i个转化成s2中前j个所需最小次数。

状态转移方程：dp[i][j]=min(dp[i-1][j]+1, min(dp[i][j-1]+1, dp[i-1][j-1]+cnt));

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int dp[1010][1010];
int main()
{
    int len1, len2;
    char s1[1010];
    char s2[1010];
    while(~scanf("%d%s%d%s", &len1, s1+1, &len2, s2+1))
    {
        for(int i=1; i<=len1; i++)     //将dp数组初始化
            dp[i][0]=i;                      //s1中前i个转化成s2中前0个所需次数为i
        for(int i=1; i<=len2; i++)     //同理
            dp[0][i]=i;
        for(int i=1; i<=len1; i++)
        {
            for(int j=1; j<=len2; j++)
            {
                int cnt=1;
                if(s1[i]==s2[j])       //当s1[i]==s2[j]时不需要改变
                    cnt=0;
                dp[i][j]=min(dp[i-1][j]+1, min(dp[i][j-1]+1, dp[i-1][j-1]+cnt));
            }
        }
        printf("%d\n", dp[len1][len2]);
    }
    return 0;
}