这道题用到了图的遍历,因为每一个格子的值所对应的墙的类型都是固定的,所以可以用四个数组来表示墙。然后要遍历整个矩阵,用一个visit数组来判断该格子是否被访问过,需要注意的是,给visit数组赋值时,需要将不同的房间赋予不同的值,以便于后面拆墙时用。如图所示。
进行拆墙时,用了一个双层循环,列为外循环,行为内循环,根据题目要求,先找最西边的,再找最南边的。代码如下。
#include<bits/stdc++.h>
using namespace std;
int wall[55][55],casvis[55][55],cascnt=0,casize[3025],M=0,N=0;
int w[16]={0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1};
int n[16]={0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1};
int e[16]={0,0,0,0,1,1,1,1,0,0,0,0,1,1,1,1};
int s[16]={0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1};
int lasx=0,lasy=0;
void casdfs(int i,int j){
casvis[i][j]=cascnt;
casize[cascnt]++;
while (!w[wall[i][j]]&&!casvis[i][j-1]&&j>1){
casdfs(i,j-1);
}
while (!n[wall[i][j]]&&!casvis[i-1][j]&&i>1){
casdfs(i-1,j);
}
while (!e[wall[i][j]]&&!casvis[i][j+1]&&j<M){
casdfs(i,j+1);
}
while (!s[wall[i][j]]&&!casvis[i+1][j]&&i<N){
casdfs(i+1,j);
}
}
int main (){
freopen ("castle.in","r",stdin);
freopen ("castle.out","w",stdout);
cin>>M>>N;
int i=0,j=0;
for (i=1;i<=N;i++){
for (j=1;j<=M;j++){
cin>>wall[i][j];
}
}
int size=0;
cascnt=1;
for (i=1;i<=N;i++){
for (j=1;j<=M;j++){
if (casvis[i][j]==0){
casdfs(i,j);
if (casize[cascnt]>size){
size=casize[cascnt];
}
cascnt++;
}
}
}
cout<<cascnt-1<<endl<<size<<endl;
int x=0,y=0,sizemax=0;
char name;
for (j=1;j<=M;j++){
for (i=N;i>=1;i--){
if (n[wall[i][j]]==1&&i>1&&(casvis[i][j]!=casvis[i-1][j])){
if ((casize[casvis[i][j]]+casize[casvis[i-1][j]])>sizemax){
sizemax=casize[casvis[i][j]]+casize[casvis[i-1][j]];
x=i;y=j;name='N';
}
}
if (e[wall[i][j]]==1&&j<M&&(casvis[i][j]!=casvis[i][j+1])){
if ((casize[casvis[i][j]]+casize[casvis[i][j+1]])>sizemax){
sizemax=casize[casvis[i][j]]+casize[casvis[i][j+1]];
x=i;y=j;name='E';
}
}
}
}
cout<<sizemax<<endl<<x<<" "<<y<<" "<<name<<endl;
return 0;
}