杭电OJ 1080（C++）

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

int dp[110][110]; //动态规划数组
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, 0 };

int c2i(char c) //字符转整数
{
	if (c == 'A') return 0;
	else if (c == 'C') return 1;
	else if (c == 'G') return 2;
	else if (c == 'T') return 3;
	else return 4;
}

int main()
{
	int T;
	int n1, n2;
	string s1, s2;
	cin >> T;
	while (T--)
	{
		memset(dp, 0, sizeof(dp));
		cin >> n1 >> s1;
		s1 = "0" + s1; //dp从s1[1]开始
		for (int i = 1; i <= n1; i++) //初始化dp数组第一行
		{
			dp[i][0] = dp[i - 1][0] + score[c2i(s1[i])][4];
		}
		cin >> n2 >> s2;
		s2 = "0" + s2; //dp从s2[1]开始
		for (int j = 1; j <= n2; j++) //初始化dp数组第一列
		{
			dp[0][j] = dp[0][j - 1] + score[4][c2i(s2[j])];
		}

		//dp[i][j]代表s1的前i个字符与s2的前j个字符的最大匹配值
		for (int i = 1; i <= n1; i++)
		{
			for (int j = 1; j <= n2; j++)
			{
				//s1[i]和'-'匹配
				int temp1 = dp[i - 1][j] + score[c2i(s1[i])][c2i('-')];
				//s2[j]和'-'匹配
				int temp2 = dp[i][j - 1] + score[c2i('-')][c2i(s2[j])];
				//s1[i]和s2[j]匹配
				int temp3 = dp[i - 1][j - 1] + score[c2i(s1[i])][c2i(s2[j])];
				//temp1,temp2,temp3中最大的赋值给dp[i][j]
				dp[i][j] = max(max(temp1, temp2), temp3);
			}
		}
		cout << dp[n1][n2] << endl;
	}
	return 0;
}