AOJ 0118 Property Distribution (果园分类）

#include <iostream>
#include <stdio.h>
using namespace std;
char orchard[101][101];
int H,W,num;
const int direction[4][2] =
{
    { -1,  0},
    {  0,  1},
    {  1,  0},
    {  0, -1},

};
void dfs(int x, int y, char w)
{
    orchard[x][y] = '.';
    for (int h = 0; h < 4; h++)
    {
        int nx = x + direction[h][0];
        int ny = y + direction[h][1];
        if (nx >= 0 && nx < W && ny >=0 && ny < H && orchard[nx][ny] == w)
        {
            dfs(nx,ny,w);
        }
    }
}

int main()
{
    std::ios::sync_with_stdio(false);
    while(cin >> H >> W, H > 0)
    {
        for(int i = 0; i < H; i++)
        {
            cin >> orchard[i];
        }
        for(int i = 0; i < H; i++)
        {
            for(int j = 0; j < W; j++)
            {
                if(orchard[i][j] == '#' || orchard[i][j] == '*' || orchard[i][j] == '@')
                {
                    dfs(i,j,orchard[i][j]);
                    num ++;
                }
            }
        }
        printf("%d",num);
    }
    return 0;
}