2320501_wa.cpp

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

#include <stdio.h>
#include <algorithm>

int n;
char map[101][101];
int f, ans;
struct node
{
	int i, j;
}queue[10001];

bool cmp(struct node a,struct node b)
{
	if(a.i==b.i)
		return a.j < b.j;
	else
		return a.i < b.i;
}

int func(int pos)
{
	if(pos<0||pos>n-1)
		return 0;
	return 1;
}

void solve()
{
	int p, q, mark;
	int pi, pj, qi, qj;
	int di, dj, tmp;

	for(p = 0; p < f; p++)
	{
		pi = queue[p].i;pj = queue[p].j;
		for(q = p+1; q <= f; q++)
		{
			mark = 1;
			qi = queue[q].i;qj = queue[q].j;
			di = qi - pi;
			dj = pj - qj;
			tmp = di*di+dj*dj;
			if(tmp<ans)
				continue;
			if(func(pi+dj)&&func(pj+di)&&func(qi+dj)&&func(qj+di))
			{
				if(map[pi+dj][pj+di]!='B'&&map[qi+dj][qj+di]!='B')
				{
					if(map[pi+dj][pj+di]=='J'||map[qi+dj][qj+di]=='J')
					{
						mark = 0;
						ans = tmp;
					}
				}
			}
			if(mark)
			{
				if(func(pi+dj)&&func(pj-di)&&func(qi+dj)&&func(qj-di))
				{
					if(map[pi+dj][pj-di]!='B'&&map[qi+dj][qj-di]!='B')
					{
						if(map[pi+dj][pj-di]=='J'||map[qi+dj][qj-di]=='J')
							ans = tmp;
					}
				}
			}
		}
	}
}

int main()
{
	int i, j;

	scanf("%d",&n);
	f = -1;ans = 0;
	for(i = 0; i < n; i++)
		scanf("%s",map[i]);
	for(i = 0; i < n; i++)
		for(j = 0; j < n; j++)
		{
			if(map[i][j]=='J')
				queue[++f].i = i,queue[f].j = j;
		}
	std::sort(queue,queue+f+1,cmp);
	solve();
	printf("%d\n",ans);
	return 1;
}