poj2396专题

POJ2396 Lake Counting

暴力搜索经典题 挑战程序设计竞赛 题目链接 #include<cstdio>#include<algorithm>using namespace std;const int maxn = 110;char G[maxn][maxn];int n, m, cnt = 0;int dx[8] = {1, -1, 0, 0, -1, 1, 1, -1}; int dy[8] = {0,