poj1979红与黑解题方案 （递归的应用）

http://poj.org/problem?id=1979

Red and Black

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 18656		Accepted: 9913

Description

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).

Sample Input

6 9
....#.
.....#
......
......
......
......
......
#@...#
.#..#.
11 9
.#.........
.#.#######.
.#.#.....#.
.#.#.###.#.
.#.#..@#.#.
.#.#####.#.
.#.......#.
.#########.
...........
11 6
..#..#..#..
..#..#..#..
..#..#..###
..#..#..#@.
..#..#..#..
..#..#..#..
7 7
..#.#..
..#.#..
###.###
...@...
###.###
..#.#..
..#.#..
0 0

Sample Output

45
59
6
13

Source

Japan 2004 Domestic

 

#include<stdio.h>

int W,H;

char  map[21][21];

int f(int a,int b)
{	
	if(  a<0  ||  b<0  ||  a>=H	||  b>=W  )      return 0;
	if(map[a][b]=='#')                           return 0;
	else                                      {   map[a][b]='#';    return 1+f(a-1,b)+f(a+1,b)+f(a,b-1)+f(a,b+1);  }
}

int main()
{
	while(scanf("%d%d",&W,&H)!=EOF  &&  W!=0  &&  H!=0)
	{
	int i,j;
	for(i=0;i<H;i++)
		scanf("%s",map[i]);
	for(i=0;i<H;i++)
		for(j=0;j<W;j++)
			if(map[i][j]=='@')
				printf("%d\n",f(i,j));
	}
			return 0;
}

该题目用了递归思想。

欢迎大家积极留言，欢迎喜欢acm的战友  以及喜欢编程的同志 同学 加我qq：827552788