POJ(3356):AGTC

最新推荐文章于 2020-07-29 16:30:42 发布

爱晒太阳的胖子

最新推荐文章于 2020-07-29 16:30:42 发布

阅读量119

点赞数

分类专栏：动态规划文章标签： DP

本文链接：https://blog.csdn.net/qq_42018521/article/details/81807432

版权

动态规划专栏收录该内容

14 篇文章 1 订阅

订阅专栏

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 14320		Accepted: 5445

Description

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

Source

Manila 2006

题目大意：

输入两个字符串，求最少操作几步，可以把两字符串变相同。

步骤：用长的字符长度减去公共序列长度即可。（题目有多组数据输入）

#include<iostream>
#include<cstdio>
#include<cstring>
const int maxn = 1000+10;

using namespace std;

int dp[maxn][maxn];
int len1,len2;
char str1[maxn],str2[maxn];
int lcs()
{
    memset(dp,0,sizeof(dp));
    for(int i=1;i<=len1;i++)
        for(int j=1;j<=len2;j++)
    {
        if(str1[i-1]==str2[j-1])
            dp[i][j]=dp[i-1][j-1]+1;
        else
            dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
    }
    return dp[len1][len2];
}

int main()
{
    while(~scanf("%d %s",&len1,str1)){
        scanf("%d %s",&len2,str2);
        int ans = lcs();
        int len = max(len1,len2);
        printf("%d\n",len - ans);
    }
    return 0;
}