深搜之红与黑

求连通子图

#include <iostream>
#include <memory.h>
#include <string>
#include <stdio.h>
#include <queue>
#include <math.h>
#include <stdlib.h>
using namespace std;
int W,H;
char Map[25][25];
int Beginx,Beginy;
int visited[25][25];
int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};
int sum;
void dfs(int x,int y)
{
    if( visited[x][y] )
        return;
    sum++;
    visited[x][y] = 1;
    for( int i = 0; i < 4; i++ )
    {
        if( Map[x + dx[i]][y + dy[i]] == '.' )
            dfs(x + dx[i], y + dy[i]);
    }
}
int main()
{
    while( cin >> W >> H ,W!=0 && H!=0)
    {
        memset(Map, 0, sizeof(Map));
        memset(visited, 0, sizeof(visited));
        for( int i = 1; i <= H; i++ )
            for( int j = 1; j <= W; j++ )
            {
                cin >> Map[i][j];
                if( Map[i][j] == '@' )
                {
                    Beginx = i;
                    Beginy = j;
                }
            }
        for( int i = 0; i <= H+1; i++ )
            for( int j = 0; j <= W+1; j++ )
            {
                if( i==0 || j==0 || i==H+1 || j==W+1 )
                    Map[i][j] = '#';
            }
        sum = 0;
        dfs(Beginx, Beginy);
        cout << sum << endl;
    }
    return 0;
}