洛谷P1140 相似碱基

洛谷P1140 相似碱基（线性dp）

dp[i][j] 表示a的前i个碱基和b的前j个碱基的最大相似程度
先提前打表表示碱基之间的配对，将输入的字符串转化成碱基索引的下标

（关键代码段）状态转移方程：

for (int i = 1 ; i < alen ; ++i){
    for (int j = 1 ; j < blen ; ++j){
        dp[i][j] = dp[i-1][j-1] + match[a[i]][b[j]] ; //直接配对
        dp[i][j] = max(dp[i][j] ,dp[i-1][j] + match[a[i]][4]) ;     //第一个碱基加空格
        dp[i][j] = max(dp[i][j], dp[i][j-1] + match[4][b[j]]) ;     //第二个碱基加空格
    }
}

完整代码：

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std ;
const int N = 105 ;
const int INF = 0x3f3f3f3f ;
int a[N] , b[N] ;
int dp[N][N] ;   

int match[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 main(){
    int n , m ;
    char astr[N] , bstr[N] ;
    scanf ("%d %s",&n,astr+1) ;
    scanf ("%d %s",&m,bstr+1) ;
    int alen = strlen(astr) ;
    int blen = strlen(bstr) ;
    for (int i = 1 ; i < alen ; ++i){
        if (astr[i] == 'A')    a[i] = 0 ;
        else if (astr[i] == 'C')    a[i] = 1 ;
        else if (astr[i] == 'G')    a[i] = 2 ;
        else if (astr[i] == 'T')    a[i] = 3 ;
    }
    for (int i = 1 ; i < blen ; ++i){
        if (bstr[i] == 'A')    b[i] = 0 ;
        else if (bstr[i] == 'C')    b[i] = 1 ;
        else if (bstr[i] == 'G')    b[i] = 2 ;
        else if (bstr[i] == 'T')    b[i] = 3 ;
    }
    for (int i = 1 ; i < alen ; ++i)    
        dp[i][0] = dp[i-1][0] + match[a[i]][4] ;
    for (int j = 1 ; j < blen ; ++j)
        dp[0][j] = dp[0][j-1] + match[4][b[j]] ;
        
    for (int i = 1 ; i < alen ; ++i){
        for (int j = 1 ; j < blen ; ++j){
            dp[i][j] = dp[i-1][j-1] + match[a[i]][b[j]] ; //直接配对
            dp[i][j] = max(dp[i][j] ,dp[i-1][j] + match[a[i]][4]) ;     //第一个碱基加空格
            dp[i][j] = max(dp[i][j], dp[i][j-1] + match[4][b[j]]) ;     //第二个碱基加空格
        }
    }
    printf ("%d\n",dp[alen-1][blen-1]) ;
    return 0 ;
}