poj 1080

 这道题目很不错。

题目大意是：给定两组DNA序列，要你求出它们的最大相似度

每个字母与其他字母或自身和空格对应都有一个打分，求在这两个字符串中插入空格，让这两个字符串的匹配分数最大

解题思路，模仿动态规划里面经典的求最长公共子序列的方法

dp[i][j]表示字符串s1  1-i的和字符串序列s2 1-j的最长公共子序列的长度

当s1[i] == s2[j] 时dp[i][j] = dp[i-1][j-1] + 1

当s1[i] != s2[j]时，dp[i][j] = max(dp[i-1][j], dp[i][j-1]);

然后这个思想运用到这个题目中

dp[i][j]用来表示字符串s1  1-i的和字符串序列s2 1-j的最大相似度

value(s1[i], s2[j])表示字符s1[i]和s2[j]的匹配值

dp[i][j] 为 dp[i-1][j-1] + value(s1[i], s2[j]),     dp[i-1][j] + value(s1[i], '-'),      dp[i][j-1] + value('-', s2[j])中的最大值

这里要处理一下边界值

dp[0][0] = 0;

dp[0][j] = dp[0][j-1] + value('-', s2[j])

dp[i][0] = dp[i-1][0] + value(s1[i], '-');

dp[0][i]表示字符串s1前i个字符串和长度为i的空格串匹配的值

最后结果就为dp[len1][len2]

 

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <map>
using namespace std;

const int maxn = 110;

int t, len1, len2, dp[maxn][maxn], index1[maxn][5], index2[maxn][5];
int matrix[5][5] = {{5,-1,-2,-1,-3},
                {-1,5,-3,-2,-4},
                {-2,-3,5,-2,-2},
                {-1,-2,-2,5,-1},
                {-3,-4,-2,-1,0}};
char s1[maxn], s2[maxn];
map<char, int> dictionary;

void LCS();

int main()
{
    
    dictionary['A'] = 0, dictionary['C'] = 1, dictionary['G'] = 2, dictionary['T'] = 3, dictionary['-'] = 4;
    
    scanf("%d", &t);
    while(t-- != 0)
    {
        scanf("%d %s", &len1, s1+1);
        scanf("%d %s", &len2, s2+1);
        LCS();
        printf("%d\n", dp[len1][len2]);
    }
   
    return 0;
}

void LCS()
{
    dp[0][0] = 0;
    for(int i = 1; i <= len1; i++)
    {
        dp[i][0] = matrix[dictionary[s1[i]]][dictionary['-']] + dp[i-1][0];
    }
    for(int j = 1; j <= len2; j++)
    {
        dp[0][j] = matrix[dictionary['-']][dictionary[s2[j]]] + dp[0][j-1];
    }
    for(int i = 1; i <= len1; i++)
    {
        for(int j = 1; j <= len2; j++)
        {
            dp[i][j] = dp[i-1][j-1] + matrix[dictionary[s1[i]]][dictionary[s2[j]]];
            dp[i][j] = max(dp[i][j], dp[i-1][j] + matrix[dictionary[s1[i]]][dictionary['-']]);
            dp[i][j] = max(dp[i][j], dp[i][j-1] + matrix[dictionary['-']][dictionary[s2[j]]]);
        }
    }
}