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=<<;
 int score[][];
 void init()
 {
     score['A']['C']=score['C']['A']=-;
     score['A']['G']=score['G']['A']=-;
     score['A']['T']=score['T']['A']=-;
     score['A']['-']=score['-']['A']=-;
     score['C']['G']=score['G']['C']=-;
     score['C']['T']=score['T']['C']=-;
     score['C']['-']=score['-']['C']=-;
     score['G']['T']=score['T']['G']=-;
     score['G']['-']=score['-']['G']=-;
     score['T']['-']=score['-']['T']=-;
 }
 int main()
 {
     int t,dp[][];
     scanf("%d",&t);
     init();
     while(t--)
     {
         int len1,len2;
         char s1[],s2[];
         scanf("%d %s",&len1,s1+);
         scanf("%d %s",&len2,s2+);
         for (int i = ; i <= len1; i++)
         {
             for (int j = ; j <= len2; j++)
             {
                 dp[i][j] = -INF;
             }
         }
         dp[][] = ;
         for (int i = ; i <= len2; i++)
         {
             dp[][i] = dp[][i-]+score[s2[i]]['-'];
         }
         for (int j = ; j <= len1; j++)
         {
             dp[j][] = dp[j-][]+score[s1[j]]['-'];
         }
         for (int i = ; i <= len1; i++)
         {
             for (int j = ; j <= len2; j++)
             {
                 if (s1[i]!=s2[j])
                 {
                     dp[i][j] = max(dp[i][j],dp[i-][j-]+score[s1[i]][s2[j]]);
                     dp[i][j] = max(dp[i][j],
                                    max(dp[i-][j]+score[s1[i]]['-'],dp[i][j-]+score['-'][s2[j]]));
                 }
                 else
                 {
                     dp[i][j] = max(dp[i][j],dp[i-][j-]+);
                 }
             }
         }
         printf("%d\n",dp[len1][len2]);
     }
     return ;
 }