这是一道DP题。
在做的时候,一开始把它当作分割形DP(像数的分割)来做,结果百思不得其解- -。
后来想到,可以先处理前1个字符,再处理前2个字符……
设dp[i][j][k]表示前i个字符中,第一条链有j个空格,第二条链有k个空格。
范围有1<=i<=len1+len2 , max(0,i-len1)<=j<=min(i,len2) , max(0,i-len2)<=k<=min(i,len1)。
范围的由来可以自己推。
再由前i-1对字符加上三种情况:
(1)碱基+碱基
(2)碱基+空格
(3)空格+碱基
得到递推关系式。太复杂,不写,自行看程序。
时间:20毫秒。
#include "stdio.h"
#include "string.h"
const int INF=9999999;
const int w[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,-INF};
const int MAXN=100;
int dp[2*MAXN+2][MAXN+2][MAXN+2];
int getnum(char ch){
switch(ch){
case 'A':return 0;
case 'C':return 1;
case 'G':return 2;
case 'T':return 3;
case '-':return 4;
}
}
int max(int a,int b,int c,int d){
a=(a>b)?a:b;
c=(c>d)?c:d;
return (a>c)?a:c;
}
int min(int a,int b,int c,int d){
a=(a<b)?a:b;
c=(c<d)?c:d;
return (a<c)?a:c;
}
int main(){
int i,j,k,l,len1,len2,n,t,maxi,mi,mj,mk;
char line1[MAXN+2],line2[MAXN+2];
scanf("%d",&n);
for(t=1;t<=n;t++){
scanf("%d %s",&len1,&line1);
scanf("%d %s",&len2,&line2);
for(i=1;i<=len1+len2;i++){
for(j=0;j<=max(len1,len2,-INF,-INF);j++){
for(k=0;k<=max(len1,len2,-INF,-INF);k++){
dp[i][j][k]=-INF;
}
}
}
dp[1][1][0]=w[getnum('-')][getnum(line2[0])];
dp[1][0][1]=w[getnum(line1[0])][getnum('-')];
dp[1][0][0]=w[getnum(line1[0])][getnum(line2[0])];
for(i=1;i<=len1+len2-1;i++){
for(j=max(0,i-len1,-INF,-INF);j<=min(i,len2,INF,INF);j++){
for(k=max(0,i-len2,-INF,-INF);k<=min(i,len1,INF,INF);k++){
if((i-j>=len1)&&(i-k>=len2))continue;
if((i-j)<len1){
if((i-k)<len2){
if(dp[i+1][j][k]<dp[i][j][k]+w[getnum(line1[i-j])][getnum(line2[i-k])]){
dp[i+1][j][k]=dp[i][j][k]+w[getnum(line1[i-j])][getnum(line2[i-k])];
//printf("dp[%d][%d][%d] = %d .\n",i+1,j,k,dp[i+1][j][k]);
}
}
if(dp[i+1][j][k+1]<dp[i][j][k]+w[getnum(line1[i-j])][getnum('-')]){
dp[i+1][j][k+1]=dp[i][j][k]+w[getnum(line1[i-j])][getnum('-')];
//printf("dp[%d][%d][%d] = %d .\n",i+1,j,k+1,dp[i+1][j][k+1]);
}
}
if((i-k)<len2){
if(dp[i+1][j+1][k]<dp[i][j][k]+w[getnum('-')][getnum(line2[i-k])]){
dp[i+1][j+1][k]=dp[i][j][k]+w[getnum('-')][getnum(line2[i-k])];
}
}
}
}
}
maxi=-INF;
for(i=max(len1,len2,-INF,-INF);i<=len1+len2;i++){
if(dp[i][i-len1][i-len2]>maxi){
maxi=dp[i][i-len1][i-len2];
//mi=i;
//mj=i-len1;
//mk=i-len2;
}
}
printf("%d\n",maxi);
}
return 0;
}