[题目链接] https://www.lydsy.com/JudgeOnline/problem.php?id=2252 [算法] 将所有是”1“的点入队,然后广度优先搜索,即可 [代码] #include<bits/stdc++.h> using namespace std; #define MAXN 1010 ] = {,,-,}; ] = {-,,,}; int i,j,n,m,tx,ty; int dist[MAXN][MAXN]; char s[MAXN][MAXN]; char v…