HDU 1080 Human Gene Functions

最长公共子序列的变形。。。。。。。看了别人的题解终于明白怎么回事了，果然动态规划博大精深。

这是题源

以下是代码：

#include <iostream>
#include <cstdio>
#include <map>
#include <algorithm>
#include <cstring>
#include <string>
#define mem(a,x) memset(a,x,sizeof(a))
using namespace std;
const int MAX = 100 + 1;
const int INF = 0x3f3f3f3f;
map<char, int> m;
int sub1[MAX] = { 0 };
int sub2[MAX] = { 0 };
int dp[MAX][MAX] = { {0} };
string s1, s2;
int score[6][6]
{
	0,0,0,0,0,0,
	0,5, -1, -2, -1, -3,
	0,-1, 5, -3, -2, -4,
	0,-2, -3, 5, -2, -2,
	0,-1, -2, -2, 5, -1,
	0,-3, -4, -2, -1, 0
};
int n;
void init()
{
	cin >> n >>s1 >> n >> s2;
	for (int i = 0; i < s1.size(); i++) sub1[i+1] = m[s1[i]];
	for (int i = 0; i < s2.size(); i++) sub2[i+1] = m[s2[i]];
	//mem(dp, -INF);//memset(dp, -INF, sizeof(dp));
	for (int i = 1; i <= 100; i++) for (int j = 1; j <= 100; j++) dp[i][j] = -INF;
	dp[0][0];
	for (int i = 1; i <= s1.size(); i++) dp[i][0] = dp[i - 1][0] + score[sub1[i]][5];
	for (int i = 1; i <= s2.size(); i++) dp[0][i] = dp[0][i - 1] + score[5][sub2[i]];
}
int main()
{
	m['A'] = 1; m['C'] = 2; m['G'] = 3; m['T'] = 4;
	int t; cin >> t;
	while (t--)
	{
		init();
		for (int i = 1; i <= s1.size(); i++)
		{
			for (int j = 1; j <= s2.size(); j++)
			{
				int tmp = dp[i - 1][j - 1] + score[sub1[i]][sub2[j]];
				tmp = max(tmp, dp[i - 1][j] + score[sub1[i]][5]);
				tmp = max(tmp, dp[i][j - 1] + score[5][sub2[j]]);
				dp[i][j] = max(dp[i][j], tmp);
			}
		}
		cout << dp[s1.size()][s2.size()] << endl;
	}
	return 0;
}