知道要动规,但完全不知道咋做。。甚至想到了dfs。。。还是没有学到LCS的精髓啊QAQ
看了大佬博客Orz:https://www.cnblogs.com/6262369sss/p/9959237.html
https://www.cnblogs.com/linkstar/p/5366170.html
再结合LCS的原理,感觉好像明白了什么。。三种情况,算出每一种的分值,取最大。初始化部分还是有点懵,感觉思路真的很巧妙。。附上AC代码:
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
using namespace std;
const int INF=0x3f3f3f3f;
const int MAX=105;
int l1,l2,len,dif;
char x[MAX],y[MAX];
int dp[MAX][MAX];
int score[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,-5
};
int judge(char c)
{
if(c=='A') return 0;
if(c=='C') return 1;
if(c=='G') return 2;
if(c=='T') return 3;
if(c=='-') return 4;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
scanf("%d%s",&l1,x+1);
scanf("%d%s",&l2,y+1);
//初始化
for(int i=1;i<=l1;i++)
for(int j=1;j<=l2;j++)
dp[i][j]=-INF;
dp[0][0]=0;
//x,y和空串匹配
for(int i=1;i<=l1;i++)
dp[i][0]=score[judge(x[i])][4]+dp[i-1][0];//注意要加前一个的值
for(int i=1;i<=l2;i++)
dp[0][i]=score[4][judge(y[i])]+dp[0][i-1];
for(int i=1;i<=l1;i++)
{
int s1=judge(x[i]);
for(int j=1;j<=l2;j++)
{
int s2=judge(y[j]);
/*if(x[i]==y[j]) //可加
dp[i][j]=max(dp[i][j],dp[i-1][j-1]+5);
else*/
dp[i][j]=max(dp[i][j],dp[i-1][j-1]+score[s1][s2]);//x[i]与y[j]匹配
dp[i][j]=max(dp[i][j],dp[i-1][j]+score[s1][4]);//x[i]与'-'匹配
dp[i][j]=max(dp[i][j],dp[i][j-1]+score[4][s2]);//y[j]与'-'匹配
}
}
printf("%d\n",dp[l1][l2]);
}
return 0;
}