后考研刷题时代正式开始,之前练dp意犹未尽,所以先拿dp题开刀,而且找了一道跟我原专业相关的题,基因序列匹配~
http://acm.hdu.edu.cn/showproblem.php?pid=1080
当年学生物信息学在书上看到了DNA序列匹配的动态规划算法,现在终于实现了它~其实就是最长公共子序列LCS的变形题,ac代码如下:
#include <stdio.h>
#include <memory.h>
#define INF -999999999
char a[210],b[210];
int an[210],bn[210];
int dp[210][210];
int score[5][5]=
{
INF,-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 conv(char c)
{
switch(c)
{
case 'A': return 1;
case 'C': return 2;
case 'G': return 3;
case 'T': return 4;
}
}
int smax(int a,int b,int c)
{
int temp=a>b?a:b;
return temp>c?temp:c;
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int n;
scanf("%d",&n);
for (int i=0;i<n;++i)
{
memset(dp,0,sizeof dp);
int alen,blen;
scanf("%d %s",&alen,a);
scanf("%d %s",&blen,b);
for (int i=0;i<alen;++i)
{
an[i+1]=conv(a[i]);
dp[i+1][0]=dp[i][0]+score[an[i+1]][0]; //dp[i][0]要单独考虑,即前面一直用-匹配的情况
}
for (int i=0;i<blen;++i)
{
bn[i+1]=conv(b[i]);
dp[0][i+1]=dp[0][i]+score[0][bn[i+1]];
}
for (int i=1;i<=alen;++i)
{
for (int j=1;j<=blen;++j)
{
dp[i][j]=smax(dp[i-1][j]+score[an[i]][0],dp[i][j-1]+score[0][bn[j]],dp[i-1][j-1]+score[an[i]][bn[j]]);
//printf("%d ",dp[i][j]);
}
//printf("\n");
}
printf("%d\n", dp[alen][blen]);
}
return 0;
}