摘要： //HDU 2487注意完全包围等情况#include <iostream>#include <cstdio>#include <queue>#include <string>#include <cstring>#include <algorithm>using namespace std;const int NMAX=101;char wmap[NMAX][NMAX];bool isTop( char id, int start, int n, int m ){ int si=start/m, sj=start%m; i 阅读全文