摘要：
#include <iostream>#include <cstdio>#include <cstring>#include <queue>using namespace std;int a[1005][1005],vis[1005][1005];int dic[4][2]={{0,1},{0,-1},{1,0},{-1,0}};int n,m;struct node{ int x,y,dir,corner;};node start,end;void bfs(){ queue<node> q; int i; node pre,cur; 阅读全文
