DFS 之 poj 2386 Lake Counting

//  [11/1/2014 JmingS]
/*
遍历整个图，找到 'W' 的点，对其周围八个点其进行深搜，若是 'W' 则用 '.' 替换。
最后，在遍历整个图的过程中，找到多少个 'W'，即答案。。。
*/

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <functional>
#include <string>
#include <cstring>
#include <vector>
#include <stack>
#include <queue>
#include <map>
using namespace std;
#define eps 1e-8
#define MAX 105

int N, M;
char Graph[MAX][MAX];
const int direction[8][2] = { { -1, 1 }, { 0, 1 }, { 1, 1 }, { -1, 0 }, { 1, 0 }, { -1, -1 }, { 0, -1 }, { 1, -1 } };

void Dfs(int x, int y) {
	Graph[x][y] = '.';
	for (int i = 0; i < 8; ++i) {
		int tx = x + direction[i][0], ty = y + direction[i][1];
		if ((tx >= 0) && (tx < N) && (ty >= 0) && (ty < M) && ('W' == Graph[tx][ty])) {
			Dfs(tx, ty);
		}
	}
	return;
}

void Solve() {
	int Sum = 0;
	for (int i = 0; i < N; ++i) {
		for (int j = 0; j < M; ++j) {
			if ('W' == Graph[i][j]) {
				Dfs(i, j);
				//cout << i << "  " << j << endl;
				++Sum;
			}
		}
	}
	printf("%d\n", Sum);
}

int main()
{
	//freopen("input.txt", "r", stdin);
	scanf("%d %d", &N, &M);
	for (int i = 0; i < N; ++i) {
		getchar();
		for (int j = 0; j < M; ++j) {
			scanf("%c", &Graph[i][j]);
		}
	}
	Solve();
	return 0;
}