Human Gene Functions(dp)

http://poj.org/problem?id=1080

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
using namespace std;

const int INF=1<<28;
int score[220][220];
void init()
{
    score['A']['C']=score['C']['A']=-1;
    score['A']['G']=score['G']['A']=-2;
    score['A']['T']=score['T']['A']=-1;
    score['A']['-']=score['-']['A']=-3;
    score['C']['G']=score['G']['C']=-3;
    score['C']['T']=score['T']['C']=-2;
    score['C']['-']=score['-']['C']=-4;
    score['G']['T']=score['T']['G']=-2;
    score['G']['-']=score['-']['G']=-2;
    score['T']['-']=score['-']['T']=-1;
}
int main()
{
    int t,dp[120][120];
    scanf("%d",&t);
    init();
    while(t--)
    {
        int len1,len2;
        char s1[120],s2[120];
        scanf("%d %s",&len1,s1+1);
        scanf("%d %s",&len2,s2+1);
        for (int i = 0; i <= len1; i++)
        {
            for (int j = 0; j <= len2; j++)
            {
                dp[i][j] = -INF;
            }
        }
        dp[0][0] = 0;
        for (int i = 1; i <= len2; i++)
        {
            dp[0][i] = dp[0][i-1]+score[s2[i]]['-'];
        }
        for (int j = 1; j <= len1; j++)
        {
            dp[j][0] = dp[j-1][0]+score[s1[j]]['-'];
        }
        for (int i = 1; i <= len1; i++)
        {
            for (int j = 1; j <= len2; j++)
            {
                if (s1[i]!=s2[j])
                {
                    dp[i][j] = max(dp[i][j],dp[i-1][j-1]+score[s1[i]][s2[j]]);
                    dp[i][j] = max(dp[i][j],
                                   max(dp[i-1][j]+score[s1[i]]['-'],dp[i][j-1]+score['-'][s2[j]]));
                }
                else
                {
                    dp[i][j] = max(dp[i][j],dp[i-1][j-1]+5);
                }
            }
        }
        printf("%d
",dp[len1][len2]);
    }
    return 0;
}