描述 http://www.lydsy.com/JudgeOnline/problem.php?id=1627 网格图,给出起点,终点,障碍,求最短路. 分析 简单的宽搜. #include <bits/stdc++.h> using namespace std; inline ;;;+c-';return x*=k;} +; int n,x,y; ]={,,,-,,,-,}; bool mark[maxn][maxn]; struct node{ int x,y,t; node(){} no…