搜索 P - 入门地图题(dfs)

Description

The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divides the land into numerous square plots. It then analyzes each plot separately, using sensing equipment to determine whether or not the plot contains oil. A plot containing oil is called a pocket. If two pockets are adjacent, then they are part of the same oil deposit. Oil deposits can be quite large and may contain numerous pockets. Your job is to determine how many different oil deposits are contained in a grid.

 

Input

The input file contains one or more grids. Each grid begins with a line containing m and n, the number of rows and columns in the grid, separated by a single space. If m = 0 it signals the end of the input; otherwise 1 <= m <= 100 and 1 <= n <= 100. Following this are m lines of n characters each (not counting the end-of-line characters). Each character corresponds to one plot, and is either `*', representing the absence of oil, or `@', representing an oil pocket.

 

Output

For each grid, output the number of distinct oil deposits. Two different pockets are part of the same oil deposit if they are adjacent horizontally, vertically, or diagonally. An oil deposit will not contain more than 100 pockets.

 

Sample Input

      
      

       
        1 1
*
3 5
*@*@*
**@**
*@*@*
1 8
@@****@*
5 5 
****@
*@@*@
*@**@
@@@*@
@@**@
0 0 
      
      

 

Sample Output

      
      

       
        0
1
2
2 
      
      
      
      


      
      
      
      

       
       题意： 找出有@组成（八个方向）被* 分成几个
      
      
      
      

       
       思路：将一个@向八个方向搜索，如果还是@ ， 则继续八个方向 搜索，并且要标记 ，一直到找不到 @ 为止 则 主函数的 sum ++ . 
      
      
      
      


      
      
      
      

       
       code: 
      
      
      
      


      
      
      
      

       
       
#if 1
#include<iostream>
#include<string.h>
using namespace std;
int m , n ;
char map[101][101] ;
bool pd[101][101] ;
int dirction[8][2]={{1,0},{-1,0},{0,1},{0,-1},{1,1},{1,-1},{-1,1},{-1,-1}} ; //八个方向
int dfs(int a, int b)
{
	int xi, yi;
	pd[a][b] = 1 ;                          //标记
	for(int i=0; i<8 ;i++)
	{
		
		  xi=a+dirction[i][0];
		  yi=b+dirction[i][1];
        if(xi>=0&&xi<m&&yi>=0&&yi<n){                    //判断不能越界
		   
	    if(map[xi][yi]=='*') continue ;             //条件一：遇到*
        if(pd[xi][yi]) continue;
        dfs(xi,yi) ;                                       //条件二:已经走过了
    }
	}
	
}

int main()
{
	
	while(cin>>m>>n&&n&&m)
	{
		int sum=0;
	   memset(pd,false,sizeof(pd)) ;         //每次都要初始化
	   memset(map,0,sizeof(map)) ;           // 
	   for(int i=0; i<m; i++)
	   {
	   	
	   
			scanf("%s",map[i]);  //   输入地图
	   }
	for(int i=0; i<m; i++)            //从地图上的每个点以此判断	{
		for(int j=0; j<n; j++)
		{
		if(!pd[i][j]&&map[i][j]=='@') 	//如果碰到了@并且没走过 ，就以这个点开始搜索
		 {
			dfs(i,j) ;
			sum++;                  //
		}
		}
	}
	
	cout << sum << endl;
		
	}
		
}

#endif