poj1080（LCS变形）

题目链接：poj1080

/*poj 1080
题意：给出两个基因字符串a,b，每一种匹配都有一个值，可以在串中添加‘-’，改变
匹配的顺序，最后求全部匹配的最大值

思路：先将字符串转化，每个字符分别用0,1,2,3,表示‘-’用4表示
状态：d[i][j]表示串a前i个和串b前j个匹配的最大值
转移方程：d[i][j] = max( d[i-1][j-1]+c[a[i]][b[j]], d[i-1][j]+c[a[i]][4], d[i][j-1]+c[4][b[j]] );
1、a取第i个字母，b取“ - ”: d[i-1][j]+c[a[i]]['-'];
2、a取“ - ”，b取第j个字母：d[i][j-1]+c['-'][b[j]];
3、a取第i个字母，b取第j个字母：d[i-1][j-1]+c[a[i]][b[j]];
*/
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <stack>
using namespace std;
const int inf = 0x3f3f3f3f;
const int N = 105;
int d[N][N];
int a[N],b[N];
int c[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,inf}};
int change(char &ch)
{
    if(ch == 'A') return 0;
    if(ch == 'C') return 1;
    if(ch == 'G') return 2;
    if(ch == 'T') return 3;
}
int main()
{
    int n,m,i,j,k,T;
    scanf("%d",&T);
    char str[105];
    while(T--)
    {
        scanf("%d%s",&n,str+1);
        for(i = 1; i <= n; i ++)
            a[i] = change(str[i]);
        scanf("%d%s",&m,str+1);
        for(i = 1; i <= m; i ++)
            b[i] = change(str[i]);
        d[0][0] = 0;
        for(i = 1; i <= n; i ++)
            d[i][0] = c[a[i]][4] + d[i-1][0];
        for(j = 1; j <= m; j ++)
            d[0][j] = c[4][b[j]] + d[0][j-1];
        for(i = 1; i <= n; i ++){
            for(j = 1; j <= m; j ++){
                int tmp1 = d[i-1][j-1] + c[a[i]][b[j]];
                int tmp2 = d[i-1][j] + c[a[i]][4];
                int tmp3 = d[i][j-1] + c[4][b[j]];
                d[i][j] = max(tmp1, max(tmp2, tmp3));
            }
        }
        printf("%d\n",d[n][m]);
    }
    return 0;
}