hdu 1241 Oil Deposits

集训第一场，A题

dfs简单题

之前看过dfs，没实现过，第一次实现出来O(∩_∩)O~水手加油~

#include<iostream>
#include<cstdio>
using namespace std;
int row,col;
char oil[1000][1000];
int to[8][2]={{-1,-1},{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1},{0,-1}};
void dfs(int i,int j)
{
    //if(oil[i][j]=='@')
    if(oil[i][j] != '@' || i >=row || j >= col || i < 0 || j < 0) return ;
    oil[i][j] = '*';
    for(int k = 0; k < 8; k++)
        dfs(i + to[k][0],j + to[k][1]);
}

int main()
{
    freopen("input.txt","r",stdin);
    int Count;
    while(cin>>row>>col && row && col)
    {
        Count = 0;
        for(int i = 0; i < row; i++)
            for(int j = 0; j < col; j++)
                cin>>oil[i][j];
        for(int i = 0; i < row; i++)
        {
            for(int j = 0; j < col; j++)
            {
                if(oil[i][j] == '@')
                   {
                        dfs(i,j);Count++;
                   }

            }
        }
        cout<<Count<<endl;
    }
    return 0;
}