题目链接 #include<stdio.h>#include<iostream>#include<string>#include<string.h>#include<math.h>#include<algorithm>#include<vector>#include<queue>using namespace std;const int maxn = 305;

简单的BFS，因为做过HDU 1372，所以做这题没用几分钟，代码类似…… #include<iostream>#include<queue>#include<cstring>using namespace std;int a,b,c,d,t,v[305][305],dist[8][2]={1,-2,2,-1,2,1,1,2,-1,2,-2,1,-2,-1,-1,-2};struct