HDU 1080 Human Gene Functions (DP)

http://acm.hdu.edu.cn/showproblem.php?pid=1080

求添加  ‘-’ 后的 最大的组合值

状态转移方程： dp[i][j]=max(dp[i-1][j-1]+num[s1[i]][s2[j]], dp[i-1][j]+num[s1[i]][5], dp[i][j-1]+num[5][s2[j]] );

由于 dp[i][0] 和dp[0][i] 的状态开始没有 进行处理，WA了多次。。。。

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#define PI acos(-1.0)
#define max(a,b) (a)>(b)? (a):(b)
#define min(a,b) (a)>(b)? (b):(a)
#define INT_MIN -0x7FFFFFFF
#define INT_MAX 0x7FFFFFFF
char str1[110],str2[110];
int s1[110],s2[110];
int dp[110][110];
int num[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 main()
{
// freopen("in.txt","r",stdin);
int i,j,k;
int t,la,lb;
scanf("%d",&t);
while(t--)
{
scanf("%d%s%d%s",&la,str1,&lb,str2);
for(i=0; i<la; i++)
{
if(str1[i]=='A') s1[i+1]=1;
else if(str1[i]=='C') s1[i+1]=2;
else if(str1[i]=='G') s1[i+1]=3;
else if(str1[i]=='T') s1[i+1]=4;
}
for(i=0; i<lb; i++)
{
if(str2[i]=='A') s2[i+1]=1;
else if(str2[i]=='C') s2[i+1]=2;
else if(str2[i]=='G') s2[i+1]=3;
else if(str2[i]=='T') s2[i+1]=4;
}
memset(dp,0,sizeof(dp));
for(i=1;i<=la;i++) dp[i][0]=dp[i-1][0]+num[s1[i]][5];//notice this!!
for(i=1;i<=lb;i++) dp[0][i]=dp[0][i-1]+num[5][s2[i]];
for(i=1;i<=la;i++)
{
for(j=1;j<=lb;j++)
{
dp[i][j]=max(dp[i-1][j-1]+num[s1[i]][s2[j]],max(dp[i-1][j]+num[s1[i]][5],dp[i][j-1]+num[5][s2[j]]));
}
}
printf("%d\n",dp[la][lb]);
}
return 0;
}