poj_1562 DFS

找最大的连通区域的个数，8方向深搜。

code:

<span style="font-size:18px;">#include <iostream>
#include <fstream>

using namespace std;

int m, n,result;
int map[110][110], visit[110][110];
fstream in("input.txt");
int x, y;
int dir[8][2] = {
	{ -1, -1 },
	{ 0, -1 },
	{ 1, -1 },
	{ -1, 0 },
	{ 1, 0 },
	{ -1, 1 },
	{ 0, 1 },
	{ 1, 1 },
};


void input()
{
	char s[110];
	for (int i = 1; i <= m; i++)
	{
		cin >> s;
		for (int j = 0; j < n; j++)
		{
			// @ -> 1   ,   * -> 0
			map[i][j+1] = (s[j]=='@'?1:0);
		}
	}
}

int find()
{
	for (int i = 1; i <= m; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			if (!visit[i][j] && map[i][j] == 1)
			{
				x = i;
				y = j;
				return 1;
			}
		}
	}
	return 0;
}

void dfs(int x, int y)
{
	for (int k = 0; k < 8; k++)
	{
		int nx = x + dir[k][0];
		int ny = y + dir[k][1];
		if (nx >= 1 && nx <= m && ny >= 1 && ny <= n && !visit[nx][ny] && map[nx][ny] == 1)
		{
			visit[nx][ny] = 1;
			dfs(nx,ny);
		}
	}
}

int main()
{
	while (cin >> m >> n && m != 0)
	{
		input();
		memset(visit,0,sizeof(visit));
		result = 0;
		while (find())
		{
			visit[x][y]=1;
			dfs(x, y);
			result++;
		}
		cout << result << endl;
	}
	//system("pause");
	return 0;
}
</span>