POJ 2386

#include <iostream>using namespace std;int N, M;char field[110][110];void dfs(int x, int y){field[x][y] = '.';for (int dx = -1; dx <= 1; dx++){for (int dy = -1; dy <= 1; dy++){int nx = x + dx, ny = y + dy;if (0 <= nx && nx < N  && 0 <= ny && ny < M && field[nx][ny] == 'W')dfs(nx, ny);}}return ;}int main(){int i, j, res = 0;cin >> N >> M;for (i = 0; i < N; i++)cin >> field[i];for (i = 0; i < N; i++){for (j = 0; j < M; j++){if (field[i][j] == 'W'){dfs(i, j);res++;}}}cout << res << endl;return 0;}