本题还是一个关于深度优先搜索和递归的算法题,原题如下:
有一个大小为N*M的园子,雨后积起了水,八连通被认为是连接在一起的,请求出园子里总共有多少洼?(八连通指的是下图中相对W的*的部分)
* * *
* w *
* * *
限制条件:
N,M <=100
本题的代码实现如下:
#include "stdafx.h"
#include <iostream>
#include <time.h>
#define MAX_N 100
using namespace std;
char field[MAX_N + 1][MAX_N+1];
int N, M;
void Isconnect(int a, int b){
field[a][b] = '*';
for (int dx = -1; dx <= 1; ++dx){
for (int dy = -1; dy <= 1; ++dy){
int nx = a + dx;
int ny = b + dy;
if (0 <= nx < N && 0<= ny < M && field[nx][ny] == 'W'){
Isconnect(nx, ny);
}
}
}
}
int _tmain(int argc, _TCHAR* argv[])
{
cout << "请输入行N和列M:";
cin >> N >> M;
for (int i = 0; i < N; ++i){
srand(time(NULL));
for (int j = 0; j < M; ++j){
field[rand()%N][rand() % M] = 'W';
if (field[i][j] != 'W'){
field[i][j] = '*';
}
}
}
for (int i = 0; i < N; ++i){
for (int j = 0; j < M; ++j){
cout << field[i][j] << ' ';
}
printf("\n");
}
int sum = 0;
for (int i = 0; i < N; ++i){
for (int j = 0; j < M; ++j){
if (field[i][j] == 'W'){
Isconnect(i, j);
sum++;
}
}
}
printf("%d\n", sum);
return 0;
}
本题的关键是理解题意,其实一个也是一处水洼,和八连通没有什么关系。代码结果如下: