AOJ 0118 Property Distribution (DFS)

http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=46522

简单DFS，题目翻译参考  http://blog.csdn.net/synapse7/article/details/14453017

#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <algorithm>
#include <string>
#include <set>
#include <functional>
#include <numeric>
#include <sstream>
#include <stack>
#include <map>
#include <queue>

#define CL(arr, val)    memset(arr, val, sizeof(arr))

#define ll long long
#define inf 0x7f7f7f7f
#define lc l,m,rt<<1
#define rc m + 1,r,rt<<1|1
#define pi acos(-1.0)

#define L(x)    (x) << 1
#define R(x)    (x) << 1 | 1
#define MID(l, r)   (l + r) >> 1
#define Min(x, y)   (x) < (y) ? (x) : (y)
#define Max(x, y)   (x) < (y) ? (y) : (x)
#define E(x)        (1 << (x))
#define iabs(x)     (x) < 0 ? -(x) : (x)
#define OUT(x)  printf("%I64d
", x)
#define lowbit(x)   (x)&(-x)
#define Read()  freopen("a.txt", "r", stdin)
#define Write() freopen("dout.txt", "w", stdout);
#define maxn 1000000000
#define N 110
using namespace std;

char filed[N][N];
int w,h,sum;
int dir[4][2]={-1,0,1,0,0,1,0,-1};

void dfs(int x,int y,char c)
{
    for(int i=0;i<4;i++)
    {
        int xx=x+dir[i][0];
        int yy=y+dir[i][1];
        if(xx>=0&&xx<h&&yy>=0&&yy<w&&filed[xx][yy]==c)
        {
            filed[xx][yy]='.';
            dfs(xx,yy,c);
        }
    }
}
int main()
{
    //freopen("a.txt","r",stdin);
    while(~scanf("%d%d",&h,&w)&&w+h)
    {
        getchar();
        for(int i=0;i<h;i++)
            scanf("%s",filed[i]);
        sum=0;
        for(int i=0;i<h;i++)
            for(int j=0;j<w;j++)
            if(filed[i][j]!='.')
            {
                dfs(i,j,filed[i][j]);
                filed[i][j]='.';
                sum++;
            }
        //printf("%d %d
",a,b);
        printf("%d
",sum);
    }
   return 0;
}