AGTC POJ 3356

 

 

#include<iostream>
#include<cstring>
#include<cstdio>
int min(int a,int b,int c){
    int temp=a>b?b:a;
    return temp>c?c:temp;
}
const int N=1010;
char a[N],b[N];
int operations(int m,int n){;
    int **dp=new int*[m+1];
    for(int i=0;i<=m;i++)
        dp[i]=new int[n+1];
    dp[0][0]=0;
    for(int i=1;i<=m;i++)dp[i][0]=i;
    for(int i=1;i<=n;i++)dp[0][i]=i;
    for(int i=1;i<=m;i++)
        for(int j=1;j<=n;j++){
            int edit=a[i-1]==b[j-1]?0:1;
            dp[i][j]=min(dp[i-1][j-1]+edit/*change or equal*/,dp[i-1][j]+1/*delete*/,dp[i][j-1]+1/*insert*/);
        }
        return dp[m][n];
}
int main()
{
    int m,n;
    while(scanf("%d %s %d %s",&m,a,&n,b)!=EOF){
        printf("%d\n",operations(m,n));
    }
    return 0;
}