题目
规定两个基因的相似度为所有对应方法中,相似度最大的那个。
分析
状态转移方程:
f
[
i
]
[
j
]
=
m
a
x
(
f
[
i
−
1
]
[
j
]
+
[
j
]
[
−
]
,
f
[
i
]
[
j
−
1
]
+
[
i
]
[
−
]
,
f
[
i
−
1
]
[
j
−
1
]
,
[
i
]
[
j
]
)
f[i][j]=max(f[i-1][j]+[j][-],f[i][j-1]+[i][-],f[i-1][j-1],[i][j])
f[i][j]=max(f[i−1][j]+[j][−],f[i][j−1]+[i][−],f[i−1][j−1],[i][j])
代码
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int tab[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}};
char s1[101],s2[101]; int a[101],b[101],f[101][101],l1,l2;
int main(){
scanf("%d %s\n%d %s",&l1,&s1,&l2,&s2);
memset(f,-127,sizeof(f)); f[0][0]=0;
for (int i=1;i<=l1;i++) //预处理
if (s1[i-1]=='A') a[i]=0;
else if (s1[i-1]=='C') a[i]=1;
else if (s1[i-1]=='G') a[i]=2;
else if (s1[i-1]=='T') a[i]=3;
for (int i=1;i<=l2;i++)
if (s2[i-1]=='A') b[i]=0;
else if (s2[i-1]=='C') b[i]=1;
else if (s2[i-1]=='G') b[i]=2;
else if (s2[i-1]=='T') b[i]=3;
for (int i=1;i<=l1;i++) f[i][0]=f[i-1][0]+tab[a[i]][4];//特殊处理
for (int i=1;i<=l2;i++) f[0][i]=f[0][i-1]+tab[b[i]][4];
for (int i=1;i<=l1;i++)
for (int j=1;j<=l2;j++)
f[i][j]=max(f[i][j-1]+tab[b[j]][4],max(f[i-1][j]+tab[a[i]][4],f[i-1][j-1]+tab[a[i]][b[j]]));//状态转移方程
printf("%d",f[l1][l2]);
return 0;
}