2843651_tle.cpp

北大大牛代码 1240道题的原代码 超级权威

#include <stdio.h>
#include <math.h>

int i, j, k, N, side, maxSide, maxi, maxj;
int A[371][371];
bool ok;

int max(int a,int b)
{
	return a>b?a:b;
}

int main()
{
	scanf("%d",&N);
	for(i = 1; i <= N; i++)
		for(j = 1; j <= N; j++)
			scanf("%d",&A[i][j]);
	maxSide = -1;
	maxi = maxj = 0;
	for(i = 1; i <= N; i++)
		for(j = 1; j <= N; j++)
		{
			for(side = 0; side <= N-max(i,j); side++)
			{
				ok = true;
				for(k = 0; k <= side; k++)
				{
					if(A[i+k][j]!=A[i+k][j+side]||A[i][j+k]!=A[i+side][j+k])
					{
						ok = false;
						break;
					}
				}
				if(ok&&side>maxSide)
				{
					maxSide = side;
					maxi = i;
					maxj = j;
				}
			}
		}
	printf("%d %d %d\n",maxi,maxj,maxSide+1);
	return 0;
}