DFS之城堡问题

2019-06-01

17:54:51

坚持！！

题目链接：

http://bailian.openjudge.cn/practice/2815

#include <bits/stdc++.h>
using namespace std;

int n = , m = ;
int roomNumber = ;
int roomSize = ;   //当前房间的面积大小
int maxRoomSize = ;
int room[][];
int color[][];

void dfs(int x, int y);

int main()
{

    scanf("%d %d", &n, &m);
    for (int i = ; i < n; i++)
    {
        for (int j = ; j < m; j++)
        {
            scanf("%d", &room[i][j]);
        }
    }

    for(int i = ; i < n; i++)
    {
        for (int j = ; j < m; j++)
        {
            if(color[i][j] == )
            {
                roomNumber++;
                roomSize = ;
                dfs(i, j);
                maxRoomSize = max(maxRoomSize, roomSize);

            }
        }
    }

    cout << roomNumber << endl;
    cout << maxRoomSize << endl;
    return ;
}

void dfs(int x, int y)
{
    if(color[x][y] != )
    {
        return;
    }
    roomSize++;
    color[x][y] = roomNumber;
    if((room[x][y] & ) == )
        dfs(x, y - );  //向西走
    if((room[x][y] & ) == )
        dfs(x - , y); //向北走
    if((room[x][y] &  )== )
        dfs(x, y + );  //向东走
    if((room[x][y] & ) == )
        dfs(x + , y); //向南走
}