标签：des style blog io ar color os sp for
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.
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.
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
Sample Output
45
Source
Japan 2004 Domestic
题目大意：给你一个房间，房间由一格格砖组成，有黑砖和红砖，只能站在黑砖上，
现在你站在其中一块黑砖上，且只能向相邻的黑砖上走，问：最多有多少块黑砖可以走
思路：数据规模不大，直接DFS上下左右四个方向
#include<stdio.h>
#include<string.h>
char map[25][25],vis[25][25];
int ans,W,H;
void dfs(int i,int j)
{
if(map[i][j] == '#')
return;
if(i < 0 || i >= H || j < 0 || j >= W)
return;
if(vis[i][j]==0)
{
ans++;
vis[i][j] = 1;
dfs(i-1,j);
dfs(i,j-1);
dfs(i,j+1);
dfs(i+1,j);
return;
}
}
int main()
{
while(~scanf("%d%d",&W,&H) && (W||H))
{
memset(map,0,sizeof(map));
memset(vis,0,sizeof(vis));
for(int i = 0; i < H; i++)
{
getchar();
scanf("%s",map[i]);
}
int posi,posj;
for(int i = 0; i < H; i++)
for(int j = 0; j < W; j++)
if(map[i][j]=='@')
{
posi = i;
posj = j;
}
ans = 0;
dfs(posi,posj);
printf("%d\n",ans);
}
return 0;
}
标签：des style blog io ar color os sp for
原文地址：http://blog.csdn.net/lianai911/article/details/41441779
