(DP)HDU 1080 Human Gene Functions

/*狀態轉移方程：dp[i][j]=max(dp[i-1][j]+w[s1[i]]['-'],dp[i][j-1]+w['-'][s2[j]],dp[i-1][j-1]+w[s1[i]][s2[j]])
	dp[i-1][j]+w[s1[i]]['-']表示s1中的字符與'-'相匹配得到的值；
	dp[i][j-1]+w['-'][s2[j]]表示'-'與s2中的字符相匹配得到的值；
	dp[i-1][j-1]+w[s1[i]][s2[j]]表示s1中的字符與s2中的字符相匹配得到的值；
*/

#include <iostream>
#include <cstdio>
#define INF 10000000
#define max(a,b) a>b?a:b
using namespace std;
int w[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,-INF,

};
/*將字符型轉化爲整型*/
int getint(char c)
{
	if(c=='A') return 1;
	else if(c=='C') return 2;
	else if(c=='G') return 3;
	else if(c=='T') return 4;
	else return 5;
}
/*得到一個權值*/
int weight(char c1,char c2)
{
	int a=getint(c1);
	int b=getint(c2);
	return w[a][b];
}
int dp[365][365];
int main()
{
//	freopen("in.txt","r",stdin);
	int i,j;
	int t;
	int n1,n2;
	char s1[105];
	char s2[105];
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d %s",&n1,s1+1);
		scanf("%d %s",&n2,s2+1);
		/*第0列賦值，就是s1與'-'的權值*/
		for(i=1;i<=n1;i++)
		{
			dp[i][0]=dp[i-1][0]+weight(s1[i],'-');
		}
		/*第0行賦值，就是'-'與s2的權值*/
		for(i=1;i<=n2;i++)
		{
			dp[0][i]=dp[0][i-1]+weight('-',s2[i]);
		}
		for(i=1;i<=n1;i++)  //表示s1
		{
			for(j=1;j<=n2;j++)  //表示s2
			{
				dp[i][j]=max(dp[i-1][j]+weight(s1[i],'-'),dp[i][j-1]+weight('-',s2[j]));
				dp[i][j]=max(dp[i][j],dp[i-1][j-1]+weight(s1[i],s2[j]));
			}
		}
		for(i=0;i<=n1;i++)
		{
			for(j=0;j<=n2;j++)
			{
				cout<<dp[i][j]<<' ';
			}
			cout<<endl;
		}
		printf("%d\n",dp[n1][n2]);
	}
	return 0;
}