【DP】HDU_2859_Phalanx

Phalanx

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1998    Accepted Submission(s): 991

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

  
  

   
   3
abx
cyb
zca
4
zaba
cbab
abbc
cacq
0
  
  

 

Sample Output

  
  

   
   3
3
  
  

 

Source

2009 Multi-University Training Contest 5 - Host by NUDT

 

Recommend

gaojie

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
char s[1010][1010];
int dp[1010][1010];
int main()
{
    int n;
    while(~scanf("%d",&n)&&n){
        memset(dp,0,sizeof(dp));
        for(int i=n-1;i>=0;i--)
            scanf("%s",s[i]);
        int ans=1;
        for(int i=n-1;i>=0;i--){
            for(int j=n-1;j>=0;j--){
                dp[i][j]=1;
                for(int k=1;k+i<n&&j+k<n;k++){
                    if(s[i+k][j]==s[i][j+k])
                        dp[i][j]=max(dp[i][j],min(dp[i+1][j+1]+1,k+1));
                    else break;
                }
                ans=max(ans,dp[i][j]);
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}