hdu 1241 dfs染色

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#define MAX 107

using namespace std;

int n,m,ans;
int mp[MAX][MAX];
char s[MAX];

int dx[]={0,1,1,-1,-1,0,1,0,-1};
int dy[]={0,-1,1,-1,1,1,0,-1,0};

void dfs ( int x , int y )
{
    for ( int i = 1 ; i <= 8 ; i++ )
    {
        int u = x + dx[i] , v = y + dy[i];
        if ( !mp[u][v] ) continue; 
        mp[u][v] = 0;
        dfs ( u , v ); 
    }
}

int main ( )
{
    while ( ~scanf ( "%d%d" , &n , &m ) )
    {
        if ( !n && !m ) break;
        memset ( mp , 0 , sizeof ( mp ) );
        for ( int i = 1 ; i <= n ; i++ )
        {
            scanf ( "%s" , s+1 );
            for ( int j = 1 ; j <= m ; j++ )
                if ( s[j]=='@' ) mp[i][j] = 1;
        }
        ans = 0;
        for ( int i = 1 ; i <= n ; i++ )
            for ( int j = 1 ; j <= m ; j++ )
                if ( mp[i][j] )
                {
                    ans++;
                    dfs ( i , j ); 
                }
        printf ( "%d\n" , ans );
    }
}