寻找最短路径

#define _CRT_SECURE_NO_WARNINGS
#define xsize 300//最大的坐标
#define size 90000//存储的最大数组
#include <stdio.h>

int sx, sy, ex, ey;//sx sy初始点, ex,ey终点
int l;
int v[xsize][xsize];//判断点是否走过
int minstep = 0;
int dx[8] = { 1,2,2,1,-1,-2,-2,-1 };
int dy[8] = { 2,1,-1,-2,-2,-1,1,2 };
struct  node
{
	int x, y, step;
}queue[size + 1];
void bfs()
{
	int front = 0;
	int rear = 0;
	queue[rear].x = sx;
	queue[rear].y = sy;
	queue[rear].step = 0;
	rear++;
	while (front < rear) {
		if (queue[front].x == ex && queue[front].y == ey) {
			minstep = queue[front].step;
			return;
		}
		for (int i = 0; i < 8; i++) {
			int nx = queue[front].x + dx[i];

			int ny = queue[front].y + dy[i];
			int nstep = queue[front].step + 1;
			if (nx >= 0 && nx < l && ny >= 0 && ny < l && v[nx][ny] == 0) {
				v[nx][ny] = 1;
				queue[rear].x = nx;
				queue[rear].y = ny;
				queue[rear].step = nstep;
				rear++;
			}
		}
		front++;
	}
}

int main()
{
	freopen("input.txt", "r", stdin);
	int T;
	scanf("%d", &T);
	//printf("%d\n", T);
	for (int t = 0; t < T; t++) {
		scanf("%d", &l);
		scanf("%d%d%d%d", &sx, &sy, &ex, &ey);
		//printf("%d\n", l);
		//printf("%d %d\n%d %d\n", sx, sy, ex, ey);
		for (int i = 0; i < l; i++) {
			for (int j = 0; j < l; j++) {
				v[i][j] = 0;
			}
		}
		v[sx][sy] = 1;
		bfs();
		printf("%d\n", minstep);
	}

	return 0;
}