// DFS求联通块.cpp : 定义控制台应用程序的入口点。
//
#include "stdafx.h"
#include<cstdio>
#include<cstring>
const int maxn = 100 + 5;
char pic[maxn][maxn];
int m, n, idx[maxn][maxn];
void dfs(int r, int c, int id)
{
if (r<0 || r>=m || c < 0 || c >= n)return;
if (idx[r][c]>0 || pic[r][c] != '@')
return;//回溯思想
idx[r][c] = id;
for (int dr = -1; dr <= 1; dr++)
{
for (int dc = -1; dc <= 1;dc++)
if (dr != 0 || dc != 0)dfs(r + dr, c + dc, id);//从左上顺时针判断8个方向
}
}
int _tmain(int argc, _TCHAR* argv[])
{
while (scanf("%d%d", &m, &n) == 2 && m&&n)
{
getchar();
for (int i = 0; i < m; i++)
gets_s(pic[i]);
memset(idx, 0, sizeof(idx));
int cnt = 0;
for (int i = 0; i < m;i++)
for (int j = 0; j < n;j++)
if (idx[i][j] == 0 && pic[i][j] == '@')dfs(i, j, ++cnt);
printf("%d\n", cnt);
}
return 0;
}
dfs算法求联通块
最新推荐文章于 2022-03-12 14:19:43 发布