ZOJ 1642 Match for Bonus

DP水题。最长公共子序列，稍稍变形即可。模型完全一样。

#include <iostream>
#include <cstring>
using namespace std;
#define MAX 2012
int dp[MAX][MAX],v[200];
char a[MAX],b[MAX];
int main()
{
    int n,i,j;
    while(cin>>n)
    {
        char ch;
        int value;
        memset(v,0,sizeof(0));
        memset(dp,0,sizeof(0));
        for(i = 1;i <= n;i++)
        {
            cin>>ch;
            cin>>value;
            v[ch] = value;
        }
        cin>>a>>b;
        int lena = strlen(a);
        int lenb = strlen(b);
        int len = max(lena,lenb);
        int ans = 0;
        for(i = 1;i <= len;i++)
            for(j = 1;j <= len;j++)
            {
                dp[i][j] = max(dp[i - 1][j],dp[i][j - 1]);
                if(a[i - 1] == b[j - 1])
                    dp[i][j] = max(dp[i][j],dp[i - 1][j - 1] + v[a[i - 1]]);
                if(dp[i][j] > ans)
                    ans = dp[i][j];
            }
        cout<<ans<<endl;
    }
    return 0;
}