HDUOJ 2859 Phalanx

HDUOJ 2859 Phalanx

题目链接

Problem Description

Today is army day, but the servicemen are busy with the phalanx for the celebration of the 60th anniversary of the PRC.
A phalanx is a matrix of size $n\ast n$, each element is a character (a~z or A~Z), standing for the military branch of the servicemen on that position.
For some special requirement it has to find out the size of the max symmetrical sub-array. And with no doubt, the Central Military Committee gave this task to ALPCs.
A symmetrical matrix is such a matrix that it is symmetrical by the “left-down to right-up” line. The element on the corresponding place should be the same. For example, here is a 3*3 symmetrical matrix:
cbx
cpb
zcc

Input

There are several test cases in the input file. Each case starts with an integer n (0<n<=1000), followed by n lines which has n character. There won’t be any blank spaces between characters or the end of line. The input file is ended with a 0.

Output

Each test case output one line, the size of the maximum symmetrical sub- matrix.

Sample Input

3
abx
cyb
zca
4
zaba
cbab
abbc
cacq
0

Sample Output

3
3

题意太迷了，我看了半天，发现是求最大对称子矩阵的边长，对称轴为左下角到右下角的那条对角线，用 $dp[i][j]$ 表示第 $i$ 行第 $j$ 列的最大子矩阵的边长，那么就有状态转移方程：
$$dp[i][j]=max(dp[i][j],dp[i-1][j+1]+1)$$
AC代码如下：

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e3+5;
int dp[N][N],ans,n;
char s[N][N];
int main(){
    while(~scanf("%d",&n)&&n){
        ans=1;
        for(int i=0;i<n;i++) scanf("%s",s[i]);
        for(int i=0;i<n;i++) for(int j=0;j<n;j++) i?dp[i][j]=0:dp[i][j]=1;
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                if(i==0) continue;
                int x=i,y=j;
                while(x>=0&&y<n&&s[x][j]==s[i][y]){
                    x--,y++;
                }
                int change=i-x;
                if(change>=dp[i-1][j+1]+1) dp[i][j]=dp[i-1][j+1]+1;
                else dp[i][j]=change;
                ans=max(ans,dp[i][j]);
            }
        }
        printf("%d\n",ans);
    }
}