一道DFS判断连通块的题目。
j讲个小技巧:
{
1:当是向上下左右扩的时候可以用:idx[]={1,0,-1,0},idy[]-{0,1,0,-1};
for(int i=0;i<4;i++){ int tx=x+idx[i], ty=y+idy[i]; }
2:当是向四周一圈扩的时候用:(方便很多)
}
题目描述
Due to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains either water ('W') or dry land ('.'). Farmer John would like to figure out how many ponds have formed in his field. A pond is a connected set of squares with water in them, where a square is considered adjacent to all eight of its neighbors. Given a diagram of Farmer John's field, determine how many ponds he has.
输入格式
Line 1: Two space-separated integers: N and M * Lines 2..N+1: M characters per line representing one row of Farmer John's field. Each character is either 'W' or '.'. The characters do not have spaces between them.
输出格式
Line 1: The number of ponds in Farmer John's field.
题意翻译
由于近期的降雨,雨水汇集在农民约翰的田地不同的地方。我们用一个 N\times M(1\leq N\leq 100, 1\leq M\leq 100)N×M(1≤N≤100,1≤M≤100) 的网格图表示。每个网格中有水(W
) 或是旱地(.
)。一个网格与其周围的八个网格相连,而一组相连的网格视为一个水坑。约翰想弄清楚他的田地已经形成了多少水坑。给出约翰田地的示意图,确定当中有多少水坑。
输入第 11 行:两个空格隔开的整数:NN 和 MM。
第 22 行到第 N+1N+1 行:每行 MM 个字符,每个字符是 W
或 .
,它们表示网格图中的一排。字符之间没有空格。
输出一行,表示水坑的数量。
:ACcode
#include<iostream>
using namespace std;
int n, m, ans;
char arr[105][105];
void dfs(int x, int y)//这个dfs其实的作用是:将主函数里已经搜索到是‘W’水坑的四周的水坑变为:‘.’
{
arr[x][y] = '.';//把已经搜索过的水坑变成:'.'(因为题目说连在一起的算一个水坑),好思路
for(int i=-1;i<=1;i++)//-1,0,1
for (int j = -1; j <= 1; j++)//-1,0,1
{
//向四周扩,搜索
int tox = x + i;
int toy = y + j;
if (tox >= 1 && toy >= 1 && tox <= n && toy <= m && arr[tox][toy] == 'W')//合法坐标,并且是水坑
{
dfs(tox, toy);
}
}
}
int main()
{
cin >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
cin >> arr[i][j];//输入地图
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
{
if (arr[i][j] == 'W')//寻找水坑
{
dfs(i, j);
ans++;//水坑数加一
}
}
cout << ans << endl;//输出
return 0;
}
over~