LCS的变形而已
注意LCS的子串可以是离散的,不必连续,用动态规划
设dp[i][j]为取s1第i个字符,s2第j个字符时的最大分值
则决定dp为最优的情况有三种(score[][]为s1[i]和s2[j]两符号的分数):
1、 s1取第i个字母,s2取“ - ”: dp[i-1][j]+score[ s1[i-1] ]['-'];
2、 s1取“ - ”,s2取第j个字母:dp[i][j-1]+score['-'][ s2[j-1] ];
3、 s1取第i个字母,s2取第j个字母:dp[i-1][j-1]+score[ s1[i-1] ][ s2[j-1] ];
c[i][j]=max{c[i-1][j-1]+mat(a[i],b[j]),c[i][j-1]+mat('-',b[j]),c[i-1][j]+mat(a[i],'-')} (其中mat(x,y)表示字符x与y匹配的权值)
则有上述状态转移方程可得边界为:
c[0][0]=0
c[i][0]=c[i-1][0]+mat(a[i],'-')
c[0][j]=c[0][j-1]+mat('-',b[j])
参考
http://blog.csdn.net/lyy289065406/article/details/6648156
http://blog.csdn.net/kk303/article/details/6689769
两个数组有可能都存在'-'的情况.
比如
2 AT
2 TA
这类情况...最优解应该是 -AT 与 TA- .
#include <iostream>
#include <stdio.h>
#include <cstring>
using namespace std;
int Map[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}};
int getMapIndex(char c)
{
switch(c)
{
case 'A':
return 0;
case 'C':
return 1;
case 'G':
return 2;
case 'T':
return 3;
case '-':
return 4;
}
}
#define MAX_G (100+1)
int Genu[3][MAX_G];
int L[3];
int Value[MAX_G][MAX_G];//dp[i][j]为取s1第i个字符,s2第j个字符时的最大分值
#define INDEX__ 4
int max3(int a,int b,int c)
{
int m = b;
if( a > b)
m=a;
if( c > m)
m=c;
return m;
}
int main()
{
int t;
while(cin>>t)
{
for(int _t =1;_t<=t;_t ++)
{
//每个test有两行
for(int i=1;i<=2;i++)
{
char c;
cin>>L[i];
getchar(); //for blank
for(int j=1;j<=L[i];j++)
{
c=getchar();
Genu[i][j]=getMapIndex(c);
//printf("i=%d,j=%d c=%c\n",i,j,c);
}
}
int l1=L[1],l2=L[2];
memset(Value,0,sizeof(Value));
Value[0][0] = 0;
for(int i=1;i<=l1;i++)
{
Value[i][0] = Value[i-1][0] + Map[ Genu[1][i]][INDEX__ ];
}
for(int j=1;j<=l2;j++)
{
Value[0][j] = Value[0][j-1] + Map[ INDEX__][Genu[2][j] ];
}
for(int i=1;i<=l1;i++)
{
for(int j=1;j<=l2;j++)
{
Value[i][j] = max3(Value[i-1][j-1] + Map[ Genu[1][i] ] [ Genu[2][j] ],
Value[i-1][j] + Map[ Genu[1][i] ] [INDEX__] ,
Value[i][j-1] + Map[ INDEX__] [ Genu[2][j] ]);
}
}
int maxret = 0;
maxret = Value[l1][l2];
cout<<maxret<<endl;
}
}
}