杭电acm之1516--String Distance and Transform Process

最新推荐文章于 2020-08-03 17:24:07 发布

代码之间

最新推荐文章于 2020-08-03 17:24:07 发布

阅读量841

点赞数

分类专栏：杭电acm 文章标签：杭电 1516 String Distance and

本文链接：https://blog.csdn.net/u012627658/article/details/23024301

版权

杭电acm 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

Problem Description

String Distance is a non-negative integer that measures the distance between two strings. Here we give the definition. A transform list is a list of string, where each string, except for the last one, can be changed to the string followed by adding a character, deleting a character or replacing a character. The length of a transform list is the count of strings minus 1 (that is the count of operations to transform these two strings). The distance between two strings is the length of a transform list from one string to the other with the minimal length. You are to write a program to calculate the distance between two strings and give the corresponding transform list.

Input

Input consists a sequence of string pairs, each string pair consists two lines, each string occupies one line. The length of each string will be no more than 80.

Output

For each string pair, you should give an integer to indicate the distance between them at the first line, and give a sequence of command to transform string 1 to string 2. Each command is a line lead by command count, then the command. A command must be

Insert pos,value
Delete pos
Replace pos,value

where pos is the position of the string and pos should be between 1 and the current length of the string (in Insert command, pos can be 1 greater than the length), and value is a character. Actually many command lists can satisfy the request, but only one of them is required.

Sample Input

  
  
   
   abcac
bcd
aaa
aabaaaa

Sample Output

  
  
   
   3
1 Delete 1
2 Replace 3,d
3 Delete 4
4
1 Insert 1,a
2 Insert 2,a
3 Insert 3,b
4 Insert 7,a

题目就一较为简单的动规,不想多说了,自己看代码,最好从中看出优化方程来,,,

#include<stdio.h>
#include<string.h>
#define SIZE 80
#define MAX 100000
int Min(int x,int y,int z){
    int min= x<y ? x : y;
    return min<z ? min : z;
}
int main(){
    char s1[SIZE];
    char s2[SIZE];
    int count[SIZE+1][SIZE+1];
    int flag[SIZE][SIZE];
    
    while(scanf("%s%s",s1,s2)!=EOF){
        //初始化flag[][] 
        for(int i=0;i<SIZE;++i)
            for(int j=0;j<SIZE;++j)
                flag[i][j]= s1[i]==s2[j] ? 0 : 1 ;
        //初始化count[][]    
        for(int i=0;i<=SIZE;++i)
            count[0][i]=count[i][0]=i;
        //计算count[][] 
        for(int i=1;i<=strlen(s1);++i)
            for(int j=1;j<=strlen(s2);++j)
                count[i][j]=Min(count[i-1][j]+1,count[i][j-1]+1,count[i-1][j-1]+flag[i-1][j-1]);
        printf("%d\n",count[strlen(s1)][strlen(s2)]);
        //打印方案 
        for(int is1=strlen(s1),is2=strlen(s2),k=1;k<=count[strlen(s1)][strlen(s2)];){
            
            int t;
            if(is1==0&&is2!=0) t=1;
            else if(is1!=0&&is2==0) t=3;
            else if(is1!=0&&is2!=0){
                if(count[is1][is2-1]==Min(count[is1-1][is2],count[is1-1][is2-1],count[is1][is2-1])) t=1;
                if(count[is1-1][is2]==Min(count[is1-1][is2],count[is1-1][is2-1],count[is1][is2-1])) t=3;
                if(count[is1-1][is2-1]==Min(count[is1-1][is2],count[is1-1][is2-1],count[is1][is2-1])) t= count[is1-1][is2-1]==count[is1][is2] ? 0:2;
            }
            switch(t){
                case 0 : --is1;--is2;break;//末尾元素一样 
                case 1 : printf("%d Insert %d,%c\n",k++,is1+1,s2[--is2]);break;//在s1末尾添加一个元素
                case 2 : printf("%d Replace %d,%c\n",k++,is1--,s2[--is2]);break;//替换末尾
                case 3 : printf("%d Delete %d\n",k++,is1--);break;//删除末尾元素 
            }
        } 
    }
    return 0;
}