http://acm.hdu.edu.cn/showproblem.php?pid=2859
#include <bits/stdc++.h>
#define maxs 2020202
#define mme(i,j) memset(i,j,sizeof(i))
using namespace std;
char s[1002][1002];
int dp[1052][1052];
int n;
int main()
{
while(~scanf("%d",&n)&&n)
{
for(int i=0;i<n;i++) scanf("%s",s[i]);
mme(dp,0);
for(int i=0;i<n;i++)
dp[0][i]=1;
int ans=1;
for(int i=1;i<n;i++)
{
for(int j=0;j<n;j++)
{
int ti=i,tj=j;
while(s[ti][j]==s[i][tj])
{
ti--;
tj++;
if(ti<0||tj>=n) break;
}
int len=tj-j;
if(len>dp[i-1][j+1] )
dp[i][j] = dp[i-1][j+1]+1;
else
dp[i][j]= len;
ans =max(ans,dp[i][j]);
}
}
printf("%d\n",ans);
}
return 0;
}