DFS/BFS

题目：
There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can’t move on red tiles, he can move only on black tiles.

Write a program to count the number of black tiles which he can reach by repeating the moves described above.
Input
The input consists of multiple data sets. A data set starts with a line containing two positive integers W and H; W and H are the numbers of tiles in the x- and y- directions, respectively. W and H are not more than 20.

There are H more lines in the data set, each of which includes W characters. Each character represents the color of a tile as follows.

‘.’ - a black tile
‘#’ - a red tile
‘@’ - a man on a black tile(appears exactly once in a data set)
The end of the input is indicated by a line consisting of two zeros.
Output
For each data set, your program should output a line which contains the number of tiles he can reach from the initial tile (including itself).

题意为：有一个长方形的房间，覆盖着正方形的瓷砖。每个磁贴都被着色为红色或黑色。一个人站在黑色的瓷砖上。他可以从一个图块移动到四个相邻图块之一。但是他不能在红色瓷砖上移动，只能在黑色瓷砖上移动。
编写一个程序，通过重复上述动作来计算他可以到达的黑色瓷砖的数量。

题解：这道题其实很简单，用递归的方法可以很轻松的做出来。我们只要先找到人的位置，再从他的位置开始向上下左右四个方向搜索，若为黑及标记并以他为原点继续四个方向搜索，最后标记的个数就是答案了。

代码如下：

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>

using namespace std;

int a[30][30],h=1,w=1;
char vis[30][30];
int ans=1;

int DFS(int x,int y)
{

	a[x][y]=1;
	if(x-1>=0&&a[x-1][y]==0&&vis[x-1][y]=='.')
	{
		ans++;
		DFS(x-1,y);
	}
	if(y-1>=0&&a[x][y-1]==0&&vis[x][y-1]=='.')
	{
		ans++;
		DFS(x,y-1);
	}
	if(x+1<h&&a[x+1][y]==0&&vis[x+1][y]=='.')
	{
		ans++;
		DFS(x+1,y);
	}
	if(y+1<w&&a[x][y+1]==0&&vis[x][y+1]=='.')
	{
		ans++;
		DFS(x,y+1);
	}
	return ans;
}

int main()
{
	cin>>w>>h;
	while(h!=0&&w!=0)
	{
		ans=1;
		for(int i=0;i<h;i++)
		cin>>vis[i];
		for(int i=0;i<h;i++)
		{
			for(int j=0;j<w;j++)
			{
				a[i][j]=0;
			}
		}
		for(int i=0;i<h;i++)
		{
			for(int j=0;j<w;j++)
			{
				if(vis[i][j]=='@') cout<<DFS(i,j)<<endl;
			}
		}
		cin>>w>>h;
	}
	return 0;
}