要做这个题目,首先要会最长公共子序列。
推荐hdu 1159. 顺带提供一篇别人写的解题报告 http://blog.csdn.net/a_eagle/article/details/7213236
然后再看这题,思路基本相同。我们将'--' 设为0 'A'设为1 'C'设为2 'G'设为3 'T'设为4.
根据输入构造序列 a和b。
则根据题中表格可以得到一个二维数组 :
int base[5][5] = {0,-3,-4,-2,-1,-3,5,-1,-2,-1,-4,-1,5,-3,-2,-2,-2,-3,5,-2,-1,-1,-2,-2,5};
dp[i][j] 为a序列拿出前i个,b序列拿出前j个 时的最大 分数( The score of the alignment )。
先准备好其中一个序列拿出0个的情况
for(i = 1; i <= n; i++) dp[i][0] = dp[i-1][0] + base[a[i]][0];
for(i = 1; i <= m; i++) dp[0][i] = dp[0][i-1] + base[0][b[i]];
然后 状态转移方程:
一式:dp[i-1][j] + base[a[i]][0] 二式:dp[i][j-1] + base[0][b[j]] 三式:dp[i-1][j-1] + base[a[i]][b[j]]
dp[i][j] = max{ 一式,二式,三式 }
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<stdlib.h>
using namespace std;
int base[5][5] = {0,-3,-4,-2,-1,-3,5,-1,-2,-1,-4,-1,5,-3,-2,-2,-2,-3,5,-2,-1,-1,-2,-2,5};
int dp[105][105],a[105],b[105],m,n;
int magic(char t)
{
if(t=='A') return 1;
else if(t=='C') return 2;
else if(t=='G') return 3;
else if(t=='T') return 4;
}
void set()
{
int i;
dp[0][0] = 0;
for(i = 1; i <= n; i++) dp[i][0] = dp[i-1][0] + base[a[i]][0];
for(i = 1; i <= m; i++) dp[0][i] = dp[0][i-1] + base[0][b[i]];
}
int main()
{
// freopen("t.txt","r",stdin);
int t,i,j;
char temp;
scanf("%d",&t);
while(t--)
{
memset(dp,0,sizeof(dp));
scanf("%d",&n);
getchar();
for(i = 1; i <= n; i++)
{
scanf("%c",&temp);
a[i] = magic(temp);
}
scanf("%d",&m);
getchar();
for(i = 1; i <= m; i++)
{
scanf("%c",&temp);
b[i] = magic(temp);
}
set();
for(i = 1; i <= n; i++)
{
for(j = 1; j <= m; j++)
{
if(a[i] == b[j]) dp[i][j] = dp[i-1][j-1] + base[a[i]][b[j]];
else
{
dp[i][j] = max(dp[i-1][j] + base[a[i]][0],max(dp[i][j-1] + base[0][b[j]],dp[i-1][j-1] + base[a[i]][b[j]]));
}
}
}
printf("%d\n",dp[n][m]);
}
}