HDU 2859 Phalanx 递推

Phalanx

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

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 <bits/stdc++.h>

using namespace std;

int n,ans,dp[1005][1005];
char ma[1005][1005];

int main()
{
    while(cin>>n&&n)
    {
        ans=0;
        for(int i=0; i<n; i++)
            scanf("%s",ma[i]);
        for(int i=0; i<n; i++)
        {
            for(int j=0; j<n; j++)
            {
                for(int k=1;; k++)
                {
                    if(i-k<0||j+k>=n||ma[i-k][j]!=ma[i][j+k])
                    {
                        dp[i][j]=k;
                        break;
                    }
                }
                if(i-1>=0&&j+1<n&&dp[i][j]>dp[i-1][j+1])
                    dp[i][j]=dp[i-1][j+1]+1;
                ans=max(ans,dp[i][j]);
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}