我的第一个搜索题

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

   
   

    
    题目说的是在一个矩阵里，有些格子是矿井，有些不是，相邻（上、下、左、右、左上、右上、左下、右下）的格子如果也是矿井，那么他们属于同一个矿井，问总共有多少个矿井。很明显就是DFS。
   
   
   
   

    
    

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


    
    
    
    

     
     
#include<iostream>
#include<cmath>
#include<algorithm>
#include<stack>
using namespace std;

char a[100][100];//用二维数组存储图结构
int p[8][2]={{-1,-1},{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1},{0,-1}};//八个方向
int m,n,cnt=0;//cnt记录油井的总个数
void f(int x, int y)//深搜一般用递归
{
    int k=0;
    for(k=0;k<8;k++)//依次扫描八个方向,寻找可行点
    {
        int x1=x+p[k][0];
        int y1=y+p[k][1];
        if(a[x1][y1]=='@' && x1>=0 && x1<m && y1>=0 && y1<n)//判断是否超出地图边界和是否可行
        {
            a[x1][y1]='#';//标记已经走过的点
            f(x1,y1);//以此点为起点继续深入搜索,这就是深度优先搜索
        }
    }
}
int main()
{
    while(cin>>m>>n && (m!=0 || n!=0))
    {
        cnt=0;
        for(int i=0;i<m;i++)
            scanf("%s",a[i]);
        for(int i=0;i<m;i++)//分别以每个点为起点扫描一次，判断连通分量
            for(int j=0;j<n;j++)//的个数
            {
                if(a[i][j]=='@')//直接忽略没有油田的点
                {
                    cnt++;
                    f(i,j);
                }
            }
        cout<<cnt<<endl;
    }
    return 0;
    
}