pku 3356 AGTC

最新推荐文章于 2019-08-11 00:53:32 发布

liyanguestc

最新推荐文章于 2019-08-11 00:53:32 发布

阅读量923

点赞数

文章标签： matrix string iostream input output integer

本文链接：https://blog.csdn.net/liyanguestc/article/details/1765108

版权

AGTC
Time Limit:1000MS Memory Limit:65536K
Total Submit:1285 Accepted:395

Description

Input

Output

Sample Input

Sample Output

 
 
  
  
   
   
   
   #include 
   
   <
   
   iostream
   
   >
   
   
#include 
   
   <
   
   string
   
   >
   
   

   
   using
   
    
   
   namespace
   
    std;

   
   int
   
    matrix[
   
   1024
   
   ][
   
   1024
   
   ];

   
   int
   
    min(
   
   int
   
    a,
   
   int
   
    b,
   
   int
   
    c)

   
   ...
   
   {
    int res;
    res=a<=b?a:b;
    if(res>=c)  res=c;
    return res;
}
   
   

   
   int
   
    main()

   
   ...
   
   {
    int i,j;
    int len1,len2;
    string str1,str2;
    while(cin>>len1)
    ...{
        cin>>str1;
        cin>>len2>>str2;
        for(i=0;i<=len1;i++)
            matrix[i][0]=i;
        for(j=0;j<=len2;j++)
            matrix[0][j]=j;
        
        for(i=1;i<=len1;i++)
            for(j=1;j<=len2;j++)
            ...{
                if(str1[i-1]==str2[j-1])
                    matrix[i][j]=min(matrix[i-1][j-1],matrix[i-1][j]+1,matrix[i][j-1]+1);
                else 
                    matrix[i][j]=min(matrix[i-1][j-1]+1,matrix[i-1][j]+1,matrix[i][j-1]+1);
            }
            cout<<matrix[len1][len2]<<endl;
    }
    return 0;
}

10 AGTCTGACGC
11 AGTAAGTAGGC

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

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

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.