Phalanx——二维dp

原题：
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
InputThere 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.OutputEach 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
code：

#include<iostream>
#include<algorithm>
using namespace std;
char s[1005][1005];
int dp[1005][1005];
int main() 
{
	int n;
	while(cin>>n&&n){
		for(int i=1;i<=n;i++)
		{
			cin>>s[i]+1;
		}
		for(int i=1;i<=n;i++)
			for(int j=1;j<=n;j++)
			{
				dp[i][j] = 1;
			}
		int maxn = 1;
		for(int i=n;i>=1;i--)
		{
			for(int j=1;j<=n;j++)
			{
				
				int k = dp[i+1][j-1];
				int sign = 0;
				for(int d=1;d<=k;d++)
				{
					if(s[i+d][j]==s[i][j-d])
					{
						dp[i][j]++;
					}else break;
				}
				maxn = max(maxn,dp[i][j]);			
			} 
				
		}
		cout<<maxn<<endl;
	}
}