【HDOJ】1243 反恐训练营

LCS.

/* 1243 */
#include <cstdio>
#include <cstring>
#include <cstdlib>

#define MAXN 2025
#define MAXM 256

char type[MAXM];
int point[MAXM];

char bullet[MAXN];
char kbfz[MAXN];
int dp[MAXN][MAXN];
int  n;

int min(int a, int b) {
    return a<b ? a:b;
}

int max(int a, int b) {
    return a>b ? a:b;
}

int abs(int x) {
    return x<0 ? -x:x;
}

int main() {
    int i, j, k;
    int l1, l2;
    
    #ifndef ONLINE_JUDGE
        freopen("data.in", "r", stdin);
    #endif
    
    while (scanf("%d", &n) != EOF) {
        memset(point, 0, sizeof(point));
        scanf("%s", type);
        for (i=0; i<n; ++i) {
            scanf("%d", &k);
            point[type[i]] = k;
        }
        scanf("%s", bullet+1);
        scanf("%s", kbfz+1);
        l1 = strlen(bullet+1);
        l2 = strlen(kbfz+1);
        for (i=0; i<=max(l1, l2); ++i) {
            dp[0][i] = 0;
            dp[i][0] = 0;
        }
        for (i=1; i<=l1; ++i) {
            for (j=1; j<=l2; ++j) {
                if (bullet[i] == kbfz[j]) {
                    dp[i][j] = dp[i-1][j-1] + point[bullet[i]];
                } else  {
                    k = max(dp[i-1][j], dp[i][j-1]);
                    dp[i][j] = max(k, dp[i-1][j-1]);
                }
            }
        }
        printf("%d
", dp[l1][l2]);
    }
    
    return 0;
}