http://poj.org/problem?id=2386
每一次搜索一个W,从它开始用DFS扩展,把一个连通块中的W都变成”."。重复下去,直到再也找不到W。
注意这道题是八连通而不是四连通。
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#include<iostream>
#define N 105
using namespace std;
int n, m, sum, flag;
string a[N];
const int dx[8] = {0, -1, 1, 0, -1, 1, 1, -1};
const int dy[8] = {-1, 0, 0, 1, -1, 1, -1, 1};
void dfs(int x, int y)
{
if (a[x][y] == 'W')
{
a[x][y] = '.';
for (int i = 0; i < 8; i++)
{
int x_ = x + dx[i];
int y_ = y + dy[i];
if (x_ >= 0 && x_ < n && y_ >= 0 && y_ < m && a[x_][y_] == 'W')
dfs(x_, y_);
}
}
}
int main()
{
int x, y;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) cin >> a[i];
sum = 0;
while (1)
{
flag = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
if (a[i][j] == 'W')
{
flag = 1;
x = i;
y = j;
break;
}
if (flag == 0) break;
dfs(x, y);
sum++;
}
printf("%d\n", sum);
return 0;
}