hdu 4618 Palindrome Sub-Array（dp）

题目链接：hdu 4618 Palindrome Sub-Array

解题思路

dp[k][i][j]表示以i，j为左上角，长度为k的正方形是否可行，dp[k][i][j]可以从dp[k-1][i+1][j+1]转移过来，只要再判断i行是否是回文串，并且i行和i+k-1行是否相同，列也一样。这里偷懒用暴力判断，水过了，应该用hash大法优化成o(1)的复杂度。

代码

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;
const int maxn = 305;

int N, M, A[maxn][maxn];

void init () {
    scanf("%d%d", &N, &M);
    for (int i = 1; i <= N; i++)
        for (int j = 1; j <= M; j++)
            scanf("%d", &A[i][j]);
}

bool dp[maxn][maxn][maxn];

bool find (int k) {
    for (int i = 1; i <= N; i++)
        for (int j = 1; j <= M; j++)
            if (dp[k][i][j]) return true;
    return false;
}

int solve () {
    memset(dp, false, sizeof(dp));
    for (int i = 1; i <= N; i++)
        for (int j = 1; j <= M; j++) dp[1][i][j] = true;
    for (int i = 1; i < N; i++)
        for (int j = 1; j < M; j++) {
            if (A[i][j] == A[i+1][j] && A[i][j] == A[i][j+1] && A[i][j] == A[i+1][j+1])
                dp[2][i][j] = true;
        }

    int n = min(N, M);
    for (int k = 3; k <= n; k++) {
        for (int i = 1; i <= N-k+1; i++) {
            for (int j = 1; j <= M-k+1; j++) {
                if (dp[k-2][i+1][j+1]) {
                    int ii = i + k - 1, jj = j + k - 1;
                    bool flag = true;
                    for (int t = 0; t < k / 2 && flag; t++) {
                        if (A[i+t][j] != A[ii-t][j] || A[i+t][j] != A[i+t][jj])
                            flag = false;
                        if (A[i][j+t] != A[i][jj-t] || A[i][j+t] != A[ii][j+t])
                            flag = false;
                    }
                    dp[k][i][j] = flag;
                }
            }
        }
    }

    while (!find(n)) n--;
    return n;
}

int main () {
    int cas;
    scanf("%d", &cas);
    while (cas--) {
        init();
        printf("%d\n", solve());
    }
    return 0;
}