hdu1080 Human Gene Functions（带权值最长公共子序列）

来源：互联网发布：网络分销管理系统编辑：程序博客网时间：2024/04/28 05:54

带权值的最长公共子序列。

原本s1[i] == s2[j]时dp[i][j] = dp[i - 1][j - 1] + 1，现在变为dp[i][j] = dp[i - 1][j - 1] + Map[s1[i]][s2[j]]。

原本s1[i] != s2[j]时dp[i][j] = max(dp[i][j - 1]，dp[i - 1][j] )，现在变为dp[i][j] = max(dp[i][j - 1] + Map['-'][s2[j]]，dp[i - 1][j] + Map[s1[i]]['-'])。

而且既然都加上权值，就可以放在一起比较。同样初始化也要加权值。

还有打表注意的技巧，何必将字母变为数字？多麻烦。直接用字母表示下标就好了~

#include <stdio.h>#include <cstring>#include <algorithm>using namespace std;const int N = 105;const int INF = 1<<27;int Map[6][6];void init(){    Map['A']['A'] = Map['T']['T'] = Map['G']['G'] = Map['C']['C'] = 5;    Map['A']['C'] = Map['C']['A'] = Map['A']['T'] = Map['T']['A'] = Map['T']['-'] = Map['-']['T'] = -1;    Map['G']['A'] = Map['A']['G'] = Map['T']['C'] = Map['C']['T'] = Map['T']['G'] = Map['G']['T'] = Map['G']['-'] = Map['-']['G'] = -2;    Map['C']['G'] = Map['G']['C'] = Map['A']['-'] = Map['-']['A'] = -3;    Map['C']['-'] = Map['-']['C'] = -4;}int main(){  //  freopen("in.txt", "r", stdin);    init();    int dp[N][N];    int T, j, i, n, l1, l2;    char s1[N], s2[N];    scanf("%d", &T);    while(T --)    {        scanf("%d %s", &l1, s1 + 1);        scanf("%d %s", &l2, s2 + 1);        for(i = 0; i <= l1; i ++)            for(j = 0; j <= l2; j ++)                dp[i][j] = -INF;        dp[0][0] = 0;        for(i = 1; i <= l1; i ++) dp[i][0] = dp[i - 1][0] + Map[s1[i]]['-'];        for(i = 1; i <= l2; i ++) dp[0][i] = dp[0][i - 1] + Map[s2[i]]['-'];        for(i = 1; i <= l1; i ++)            for(j = 1; j <= l2; j ++)                dp[i][j] = max(dp[i - 1][j - 1] + Map[s1[i]][s2[j]], max(dp[i - 1][j] + Map[s1[i]]['-'], dp[i][j - 1] + Map['-'][s2[j]]));        printf("%d\n", dp[l1][l2]);    }    return 0;}

0 0