PhalanxTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2064 Accepted Submission(s): 1014
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
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
Sample Output
Source
Recommend
gaojie
|
题意: 给你一个n*n矩阵问你最大的关于左下到右上的对称子阵的边的大小
看了一下最小是1 /。///这里wa了7发。。 然后二维背包跑一下就出了 xx --》xxx xx xxx xxx 就是添加了一个竖行一个横行 然后判断添加是否相等。
|
hdu 2859 Phalanx(二位动态规划)
最新推荐文章于 2022-03-08 16:37:58 发布