1045. Favorite Color Stripe (30)解题报告

颜色种类的数量似乎多余。

#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <iostream>

int *arr1, *arr2, n, m;
int LCS(void);

int main(void) {
    int i, color;
    scanf("%d %d", &color, &n);
    arr1 = new int[n];

    for (i = 0; i < n; i++) {
        scanf("%d", arr1 + i);
    }
    scanf("%d", &m);
    arr2 = new int[m];
    for (i = 0; i < m; i++) {
        scanf("%d", arr2 + i);
    }
    printf("%d\n", LCS());
    delete[] arr1;
    delete[] arr2;
    return 0;
}

int LCS(void) {
    int **matrix, i, j, longest;
    matrix = (int **)calloc(n, sizeof(int *));
    for (i = 0; i < n; i++) {
        matrix[i] = (int *)calloc(m, sizeof(int));
    }
    for (i = 0, j = 0; i < n; i++) {
        if (arr1[i] == arr2[j]) {
            matrix[i][j] = 1;
        }
        else if(i != 0) {
            matrix[i][j] = matrix[i - 1][j];
        }
        else {
            matrix[i][j] = 0;
        }
    }
    for (i = 0, j = 1; j < m; j++) {
        if (arr1[i] == arr2[j]) {
            matrix[i][j] = 1 + matrix[i][j - 1];
        }
        else {
            matrix[i][j] = matrix[i][j - 1];
        }
    }
    for (i = 1; i < n; i++) {
        for (j = 1; j < m; j++) {
            int tmp = matrix[i - 1][j] > matrix[i][j - 1] ? matrix[i - 1][j] : matrix[i][j - 1];
            if (arr1[i] == arr2[j]) {
                matrix[i][j] = tmp + 1;
            }
            else {
                matrix[i][j] = tmp;
            }
        }
    }
    longest = matrix[n - 1][m - 1];
    for (i = 0; i < n; i++) {
        free(matrix[i]);
    }
    free(matrix);
    return longest;
}