Phalanx (HDU - 2859) DP

HDU 1078 FatMouse and Cheese （简单DP）

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 subarray. 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

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e3+5;
char mp[N][N];
int dp[N][N];
int main()
{
	int n;
	while(~scanf("%d",&n)&&n)
	{
		int ans=1;
		for(int i=0;i<n;i++)
		{
			scanf("%s",mp[i]);
		}
		for(int i=0;i<n;i++)
		{
			for(int j=0;j<n;j++)
			{
				if(j==n-1||i==0){
					dp[i][j]=1;
					continue;
				}
				int ti=i,tj=j;
				while(ti>=0&&tj<n&&mp[ti][j]==mp[i][tj])
				{
					ti--;
					tj++;
				}
				int se=i-ti;
				if(se>=dp[i-1][j+1]+1)
				{
					dp[i][j]=dp[i-1][j+1]+1;
				}
				else
					dp[i][j]=se;
				ans=max(ans,dp[i][j]);
			}
		}
		printf("%d\n",ans);
	}
	return 0;
}