摘要:
优先队列+bfsAC Code 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 using namespace std; 5 int vis[25][25]; 6 int map[25][25],tmp[25][25]; 7 int k; 8 int x1,y1,x2,y2,r,c; 9 struct 10 { 11 int x,y,val; 12 }a[505]; 13 void down() 14 { 15 int x=a[k].x,y=a[k].y,val=a[k].. 阅读全文