搜索
BFSeg.1原题链接:https://ac.nowcoder.com/acm/contest/9986/IAC代码:#include<bits/stdc++.h>using namespace std;const int N = 1000;struct node{ int x; int y; int step;}s,g,Node;int n,m,flag;char mp[N][N];int vis[N][N];int X[5]={0, 0, 1, -1};
原创
2021-02-24 15:11:39 ·
2736 阅读 ·
0 评论