poj 1080

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

知识点 ：最长公共子序列

要点：

转移方程  f[i][j]  = max{ f[i-i][j]+score[s1[i-1]]['-'],  f[i][j-1]+score['-'][s2[j-1]],  f[i-1][j-1]+score[s1[i-1]][s2[j-1]]}

#include <iostream>

using namespace std;
int score['T'+]['T'+];
int dp[][];
char s1[],s2[];
void init(){
    score['A']['A']=;
    score['C']['C'] =;
    score['G']['G'] =;
    score['T']['T'] =;
    score['-']['-'] = -;
    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 mx(int a,int b,int c){
    int k = a>b?a:b;
    return c>k?c:k;
}
int main()
{
    init();
    int t;
    cin>>t;
    while(t--){
        int len1,len2;
        cin>>len1>>s1>>len2>>s2;
        dp[][] =;
        for(int i=;i<=len1;i++){
            dp[i][] = dp[i-][]+score[s1[i-]]['-'];
        }
        for(int j=;j<=len2;j++){
            dp[][j] = dp[][j-]+score['-'][s2[j-]];
        }
        for(int i=;i<=len1;i++){
            for(int j=;j<=len2;j++){
                int temp1 = dp[i-][j]+score[s1[i-]]['-'];
                int temp2 = dp[i][j-]+score['-'][s2[j-]];
                int temp3 = dp[i-][j-]+score[s1[i-]][s2[j-]];
                dp[i][j] = mx(temp1,temp2,temp3);
            }
        }
        cout<<dp[len1][len2]<<endl;
    }
    return ;
}