POJ 1080

题目大意是：给定两组DNA序列，要你求出它们的最大相似度。每个字母与其他字母或自身和空格对应都有一个打分，求在这两个字符串中插入空格，让这两个字符串的匹配分数最大

思路：最长公共子序列变形

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<stack>
#include<algorithm>
#include<vector>
#define y1 y12345
#define mx 1100
#define inf 0x3f3f3f3f
#define LL long long
#define ULL unsigned long long
#define mod 1000000007
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
using namespace std;

int cvalue[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}};
int dp[mx][mx];
int a[mx],b[mx];

int max(int a,int b){
    if(a>b)return a;
    return b;
}

int main(){
    int t;
    cin>>t;
    while(t--){
        string s1,s2;
        int n,m;
        cin>>n>>s1>>m>>s2;
        s1='0'+s1; s2='0'+s2;
        for(int i=1;i<=n;i++){
            if(s1[i]=='A')a[i]=0;
            if(s1[i]=='C')a[i]=1;
            if(s1[i]=='G')a[i]=2;
            if(s1[i]=='T')a[i]=3;
        }
        for(int i=1;i<=m;i++){
            if(s2[i]=='A')b[i]=0;
            if(s2[i]=='C')b[i]=1;
            if(s2[i]=='G')b[i]=2;
            if(s2[i]=='T')b[i]=3;
        }

        dp[0][0]=0;
        for(int i=1;i<=n;i++)
        dp[i][0] = dp[i-1][0] + cvalue[a[i]][4];
        for(int j=1;j<=m;j++)
        dp[0][j] = dp[0][j-1] + cvalue[4][b[j]];
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                dp[i][j]=dp[i-1][j-1]+cvalue[a[i]][b[j]];
                dp[i][j]=max(dp[i][j],dp[i-1][j]+cvalue[a[i]][4]);
                dp[i][j]=max(dp[i][j],dp[i][j-1]+cvalue[4][b[j]]);
            }
        }
        printf("%d\n",dp[n][m]);
    }
    return 0;
}