Phalanx
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1330 Accepted Submission(s): 662
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*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
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
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
Source
Recommend
gaojie
解题思路:用dp[i][j]表示第i行第j列能组成符合的对称矩阵的最大宽度
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <climits>
using namespace std;
#define LL long long
const int N=1009;
int dp[N][N];
char ch[N][N];
int main()
{
int n;
while(~scanf("%d",&n)&&n)
{
memset(dp,0,sizeof dp);
for(int i=0; i<n; i++)
{
scanf("%s",ch[i]);
dp[0][i]=1;
}
int ans=1;
for(int i=1; i<n; i++)
{
for(int j=0; j<n; j++)
{
int x=i-1,y=j+1,sum=1;
while(x>=0&&x<n&&y>=0&&y<n&&ch[x][j]==ch[i][y])
{
sum++;x--;y++;
}
if(sum>dp[i-1][j+1]) dp[i][j]=dp[i-1][j+1]+1;
else dp[i][j]=sum;
ans=max(dp[i][j],ans);
}
}
printf("%d\n",ans);
}
return 0;
}
因为前几行对下一行没有影响的,所以只需要保存当前行各列组成符合的对称矩阵的最大宽度
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <climits>
using namespace std;
#define LL long long
const int N=1009;
int dp[N];
char ch[N][N];
int main()
{
int n;
while(~scanf("%d",&n)&&n)
{
memset(dp,0,sizeof dp);
for(int i=0; i<n; i++)
{
scanf("%s",ch[i]);
dp[i]=1;
}
int ans=1;
for(int i=1; i<n; i++)
{
for(int j=0; j<n; j++)
{
int x=i-1,y=j+1,sum=1;
while(x>=0&&x<n&&y>=0&&y<n&&ch[x][j]==ch[i][y])
{
sum++;x--;y++;
}
if(sum>dp[j+1]) dp[j]=dp[j+1]+1;
else dp[j]=sum;
ans=max(dp[j],ans);
}
}
printf("%d\n", ans);
}
return 0;
}