【LCS变形】 poj1080

最新推荐文章于 2019-10-07 22:05:26 发布

圣托里尼的日落啊~

最新推荐文章于 2019-10-07 22:05:26 发布

阅读量154

点赞数

分类专栏：动态规划

本文链接：https://blog.csdn.net/qq_39504764/article/details/94215735

版权

动态规划专栏收录该内容

24 篇文章 1 订阅

订阅专栏

题目来源：poj 1080

思路：

设 $d p [i] [j]$ 表示字符串s1的 $i$ 号位和字符串s2的 $j$ 号位之前的字符的最大相似分值。
则决定 $d p [i] [j]$ 为最优的情况有三种

s1取第 $i$ 个字母，s2取第 $j$ 个字母： $d p [i] [j] = d p [i - 1] [j - 1] + s c o r e [s 1 [i]] [s 2 [i]]$
s1取第 $i$ 个字母，s2取’-’： $d p [i] [j] = d p [i - 1] [j] + s c o r e [s 1 [i] [^{'} -^{'}]$
s1取’-’，s2取第 $j$ 个字母： $d p [i] [j] = d p [i] [j - 1] + s c o r e [^{'} -^{'}] [s 2 [j]]$

#include <iostream>
#include <cstring>
#include <map>
#include <string>
using namespace std;
const int maxn = 110;
int dp[maxn][maxn];
int score[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}};

map<char, int> m;
int main()
{
    int T;
    cin >> T;
    while (T--)
    {
        string s1, s2;
        int n1;
        cin >> n1;
        cin >> s1;
        int n2;
        cin >> n2;
        cin >> s2;
        dp[0][0] = 0;
        m['A'] = 0;
        m['C'] = 1;
        m['G'] = 2;
        m['T'] = 3;
        m['-'] = 4;
        s1 = ' ' + s1;
        s2 = ' ' + s2;
        memset(dp, 0, sizeof(dp));
        for (int i = 1; i <= n1; i++)
        {
            dp[i][0] = dp[i - 1][0] + score[m[s1[i]]][m['-']];
        }
        for (int i = 1; i <= n2; i++)
        {
            dp[0][i] = dp[0][i - 1] + score[m['-']][m[s2[i]]];
        }
        for (int i = 1; i <= n1; i++)
        {
            for (int j = 1; j <= n2; j++)
            {
                int temp1 = dp[i - 1][j - 1] + score[m[s1[i]]][m[s2[j]]];
                int temp2 = dp[i - 1][j] + score[m[s1[i]]][m['-']];
                dp[i][j] = max(temp1, temp2);
                int temp3 = dp[i][j - 1] + score[m['-']][m[s2[j]]];
                dp[i][j] = max(dp[i][j], temp3);
            }
        }
        cout << dp[n1][n2] << endl;
    }
    return 0;
}