深度优先搜索之城堡问题

#include<iostream>
#include<stack>
#include<cstring>
#include<algorithm>
using namespace std;
int R, C;
int rooms[60][60];
int color[60][60];
int maxRoomArea = 0, roomNum = 0;
int roomArea;
void Dfs(int i, int k) {
    if (color[i][k])
        return;
    ++roomArea;
    color[i][k] = roomNum;
    if ((rooms[i][k] & 1) == 0) Dfs(i, k - 1);//西
    if ((rooms[i][k] & 2) == 0) Dfs(i - 1, k);//北
    if ((rooms[i][k] & 4) == 0) Dfs(i, k + 1);//东
    if ((rooms[i][k] & 8) == 0) Dfs(i + 1, k);//南
}
int main() {
    cin >> R >> C;
    for (int i = 1; i <= R; ++i)
        for (int k = 1; k <= C; ++k)
            cin >> rooms[i][k];
    memset(color, 0, sizeof(color));
    for (int i = 1; i <= R; ++i) {
        for (int k = 1; k <= C; ++k) {
            if (!color[i][k]) {
                ++roomNum;
                roomArea = 0;
                Dfs(i, k);
                maxRoomArea = max(roomArea, maxRoomArea);
            }
        }
    }
    cout << roomNum << endl;//城堡房间数
    cout << maxRoomArea << endl;//城堡中最大房间所包含的方块数
}