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*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
InputThere 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.OutputEach test case output one line, the size of the maximum symmetrical sub- matrix.
A phalanx is a matrix of size n*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
Sample Input
3 abx cyb zca 4 zaba cbab abbc cacq 0Sample Output
3 3
给出一个n*n的字符矩阵,求这个矩阵中最大 反对角线 对称矩阵。当长度为1时,矩阵都为对称矩阵当长度为1时,矩阵都为对称矩阵。初始化dp[i][j]=1。从右上角开始dp找到左下角。
#include<bits/stdc++.h>
using namespace std;
char s[1005][1005];
int dp[1005][1005];
int main()
{
int n;
while(~scanf("%d",&n)&&n)
{
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
dp[i][j]=1;
for(int i=0;i<n;i++)
scanf("%s",s[i]);
int ans=1;
for(int i=0;i<n;i++)
{
for(int j=n-1;j>=0;j--)
{
if(i==0||j==n-1) {dp[i][j]=1;continue;}
int r=dp[i-1][j+1];
for(int k=1;k<=r;k++)
{
if(s[i-k][j]==s[i][j+k]) dp[i][j]++;
else break;
}
ans=max(ans,dp[i][j]);
}
}
printf("%d\n",ans);
}
}