HDU 1241 Oil Deposits

题目描述

The GeoSurvComp geologic survey company is responsible for detectingunderground oil deposits. GeoSurvComp works with one large rectangularregion of land at a time, and creates a grid that divides the land intonumerous square plots. It then analyzes each plot separately, usingsensing equipment to determine whether or not the plot contains oil. Aplot containing oil is called a pocket. If two pockets are adjacent,then they are part of the same oil deposit. Oil deposits can be quitelarge and may contain numerous pockets. Your job is to determine howmany different oil deposits are contained in a grid.

输入描述:

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.
       

输出描述:

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.

相邻的话就(x,y) 附近8个位置，递归，直到所有点都被找过了

#include <stdio.h>

char map[110][110];
bool arrive[101][101];
int m,n;
int cnt;
bool startCnt;

void dfs(int x,int y){
    if(x<0||x>=m||y<0||y>=n) return;//超出边界
    if(arrive[x][y]) return;//已经访问过
    arrive[x][y]=true;//访问这个点
    if(map[x][y]=='*') return;//没有oil
    if(map[x][y]=='@'){
        //若在寻找相邻点的过程中，则继续寻找
        if(startCnt==true)
        {
            dfs(x-1,y); dfs(x-1,y-1); dfs(x-1,y+1);
            dfs(x,y-1); dfs(x,y+1);
            dfs(x+1,y); dfs(x+1,y-1); dfs(x+1,y+1);
            return;
        }else{//若是一个新的开始寻找的点
            cnt++;//计数器
            startCnt=true;//设置为在寻找与(x,y)相邻的点
            dfs(x-1,y); dfs(x-1,y-1); dfs(x-1,y+1);
            dfs(x,y-1); dfs(x,y+1);
            dfs(x+1,y); dfs(x+1,y-1); dfs(x+1,y+1);
            return;
        }
    }
}

void travel(){
    cnt=0; startCnt=false;
    for(int i=0;i<m;i++){
        for(int j=0;j<n;j++){
            //每个点都要看是不是遍历过了
            if(arrive[i][j]==false){
                startCnt=false;
                dfs(i,j);
            }
        }
    }
}

int main(){
    while(scanf("%d%d",&m,&n)!=EOF){
        if(m==0) break;
        for(int i=0;i<m;i++){
            scanf("%s",map[i]);
            for(int j=0;j<n;j++){
                arrive[i][j]=false;
            }
        }
        travel();
        printf("%d\n",cnt);
    }
    return 0;
}