POJ1164

#include<iostream>
#include<stack>
#include<cstring>
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(maxRoomArea,roomArea);
            }
        }
    }
    cout<<roomNum<<endl;
    cout<<maxRoomArea<<endl;
}

#include<iostream>
#include<stack>
#include<cstring>
using namespace std;

int R,C;
int rooms[60][60];
int color[60][60];

int maxRoomArea=0,roomNum=0;
int roomArea;

struct Room{
    int r,c;
    Room(int rr,int cc):r(rr),c(cc) {};
};
void Dfs(int r,int c){//栈

    stack<Room> stk;
    stk.push(Room(r,c));
    while(!stk.empty()){
        Room rm=stk.top();
        int i=rm.r;
        int k=rm.c;
        if(color[i][k]){
            stk.pop();
        }else{
            roomArea++;
            color[i][k]=roomNum;

            if((rooms[i][k]&1)==0) stk.push(Room(i,k-1));
            if((rooms[i][k]&2)==0) stk.push(Room(i-1,k));
            if((rooms[i][k]&4)==0) stk.push(Room(i,k+1));
            if((rooms[i][k]&8)==0) stk.push(Room(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(maxRoomArea,roomArea);
            }
        }
    }
    cout<<roomNum<<endl;
    cout<<maxRoomArea<<endl;
}