Phalanx
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1982 Accepted Submission(s): 987
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
解析:从右上角开始,把当前元素看成是对角线上的元素,如果它上方和右方的匹配数大于右上角对称矩阵的尺寸,那么到这个元素的对称数就是+1,否则这个匹配数就是对称数。具体见代码:
#include <stdio.h>
#include <algorithm>
using namespace std;
#define N 1005
char str[N][N];
int dp[N][N];
int main(){
int n;
while(scanf("%d", &n) && n){
for(int i = 0; i < n; i++)
scanf("%s", str[i]);
int ans = 1;
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if(i == 0 || j == n-1){
dp[i][j] = 1;
continue;
}
int t1 = i, t2 = j;
while(t1 >= 0 && t2 < n && str[t1][j] == str[i][t2]){
t1--;
t2++;
}
t1 = i - t1;
if(t1 >= dp[i-1][j+1] + 1)
dp[i][j] = dp[i-1][j+1] + 1;
else
dp[i][j] = t1;
ans = max(ans, dp[i][j]);
}
}
printf("%d\n", ans);
}
return 0;
}
开始想到的方法估计都会超时,看了网上大神的做法才明白- -