ZOJ-1027

应该算是第一道DP，刚看完算法导论DP里面的LCS这一节，就拿这题来练练手了，基本算法差不多，稍加改动就行，只是感觉自己还没有完全理解c[i][j]这张表，可能多练练DP会加深理解吧

#include<stdio.h>
#include<string.h>
#include<stdlib.h>

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

int LCS(char *s1, char *s2, char *k, char g[5][5])
{
    int m = strlen(s1);
    int n = strlen(s2);
    int i, j;
    int **c = malloc((m + 1) * sizeof(int*));
    for (i = 0; i < m + 1; i++)
        c[i] = malloc((n + 1) * sizeof(int));

    c[0][0] = 0;
    for (i = 1; i < m + 1; i++)
        c[i][0] = c[i - 1][0] + g[k[s1[i - 1]]][k['-']];
    for (j = 1; j < n + 1; j++)
        c[0][j] = c[0][j - 1] + g[k['-']][k[s2[j - 1]]];

    for (i = 1; i < m + 1; i++)
        for (j = 1; j < n + 1; j++)
        {
            int a = c[i - 1][j - 1] + g[k[s1[i - 1]]][k[s2[j - 1]]];
            int b = c[i - 1][j] + g[k[s1[i - 1]]][k['-']];
            int cc = c[i][j - 1] + g[k['-']][k[s2[j - 1]]];
            c[i][j] = max(a, b, cc);
        }

    int r = c[i - 1][j - 1];
    for (i = 0; i < m + 1; i++)
        free(c[i]);
    free(c);

    return r;
}

int main()
{
    char m[85];
    m['A'] = 0;
    m['C'] = 1;
    m['G'] = 2;
    m['T'] = 3;
    m['-'] = 4;

    char g[5][5] = { { 5, -1, -2, -1, -3 }, { -1, 5, -3, -2, -4 }, { -2, -3, 5,
                                                                     -2, -2 },
                     { -1, -2, -2, 5, -1 }, { -3, -4, -2, -1, 0 } };

    int n;
    char s1[101], s2[101];
    scanf("%d", &n);
    while (n--)
    {
        scanf("%*d %s", s1);
        scanf("%*d %s", s2);
        printf("%d\n", LCS(s1, s2, m, g));
    }
    return 0;
}