loi_王振东

题目>>http://codevs.cn/problem/1269/#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<queue>using namespace std;const int MAXN = 8e5 + 5;const int INF = 1e7;struct zz

由于不太会打bfs，这题用的dfs。通过这道题还是学到了蛮多的东西的。首先，瞎打一气（dfs + 标记走过的点）40分。 代码如下：#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int X[] = {0,1,0,-1};const int Y