题目1460：Oil Deposit(递归遍历图)

题目链接：http://ac.jobdu.com/problem.php?pid=1460

详解链接：https://github.com/zpfbuaa/JobduInCPlusPlus

参考代码：

//
//  1460 Oil Deposit.cpp
//  Jobdu
//
//  Created by PengFei_Zheng on 23/04/2017.
//  Copyright © 2017 PengFei_Zheng. All rights reserved.
//
 
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string.h>
#include <cmath>
#define MAX_SIZE 101
 
using namespace std;
 
char plot[MAX_SIZE][MAX_SIZE];
bool visited[MAX_SIZE][MAX_SIZE];
int change[][]={{-,-,-,,,,,},{-,,,-,,-,,}};
 
int n, m;
 
void DFS(int x, int y){
    for(int i =  ; i <  ; i++){
        int nx = x + change[][i];
        int ny = y + change[][i];
        if(nx< || nx>=n || ny< || ny>=m) continue;
        if(plot[nx][ny]=='*') continue;
        if(visited[nx][ny]==true) continue;
        visited[nx][ny]=true;
        DFS(nx,ny);
    }
    return;
}
int main(){
    //    for(int i = 0 ; i < 8 ; i ++){
    //        cout<<"change[0]["<<i<<"] = "<<change[0][i]<<" ";
    //        cout<<"change[1]["<<i<<"] = "<<change[1][i]<<endl;
    //    }
    while(scanf("%d%d",&n,&m)!=EOF){
        if(==n && ==m) break;
 
        for(int i =  ; i < n ; i++){
            scanf("%s",plot[i]);
        }
 
        for(int i = ; i < n ; i ++){
            for(int j =  ; j < m ; j++){
                visited[i][j]=false;
            }
        }
        int ans = ;
        for(int i =  ; i < n ; i++){
            for(int j =  ; j < m ; j++){
                if(visited[i][j]==true) continue;
                if(plot[i][j]=='*') continue;
                DFS(i,j);
                ans++;
            }
        }
        printf("%d\n",ans);
    }
    return ;
}
/**************************************************************
    Problem: 1460
    User: zpfbuaa
    Language: C++
    Result: Accepted
    Time:10 ms
    Memory:1540 kb
****************************************************************/