The Castle

链接

分析：先暴力求出联通块数和最大联通块包含多少，接着对于每个位置判断去掉其上下左右的四个位置的墙之后的最大联通块数，并且记得先选最西，然后选最南的顺序了来输出

 /*
     PROB:castle
     ID:wanghan
     LANG:C++
 */
 #include "iostream"
 #include "cstdio"
 #include "cstring"
 using namespace std;
 const int maxn=+;
 int n,m,a[maxn][maxn],vis[maxn][maxn];
 int ans,cnt;
 int dx[]={,-,,};
 int dy[]={-,,,};
 int r[]={,,,};
 bool judge(int x,int y){
     if(x>n||x<=||y<=||y>m)
         return false;
     return true;
 }
 void dfs(int x,int y){
     if(vis[x][y])
         return ;
     vis[x][y]=;
     ans++;
     for(int i=;i<;i++){
         int sx=x+dx[i],sy=y+dy[i];
         if(judge(sx,sy)){
             if((a[x][y]&r[i])==)
                 dfs(sx,sy);
         }
     }
     /*
     if((a[x][y]&1)==0)  dfs(x,y-1);
     if((a[x][y]&2)==0)  dfs(x-1,y);
     if((a[x][y]&4)==0)  dfs(x,y+1);
     if((a[x][y]&8)==0)  dfs(x+1,y);*/
 }
 int main()
 {
     freopen("castle.in","r",stdin);
     freopen("castle.out","w",stdout);
     cin>>m>>n;
     for(int i=;i<=n;i++){
         for(int j=;j<=m;j++)
             cin>>a[i][j];
     }
     memset(vis,,sizeof(vis));
     cnt=;
     int res=;
     for(int i=;i<=n;i++){
         for(int j=;j<=m;j++){
             if(!vis[i][j]){
                 ++cnt;
                 ans=;
                 dfs(i,j);
                 res=max(res,ans);
             }
         }
     }
     cout<<cnt<<endl;
     cout<<res<<endl;
     string ch="";
     int x,y;
     res=;
     for(int j=;j<=m;j++){
         for(int i=n;i>=;i--){
             if((a[i][j]&)){
                 memset(vis,,sizeof(vis));
                 ans=;
                 a[i][j]-=;
                 dfs(i,j);
                 if(ans>res){
                     res=ans;
                     x=i,y=j;
                     ch="";
                     ch="W";
                 }
                 a[i][j]+=;
             }
             if((a[i][j]&)){
                 memset(vis,,sizeof(vis));
                 ans=;
                 a[i][j]-=;
                 dfs(i,j);
                 if(ans>res){
                     res=ans;
                     x=i,y=j;
                     ch="";
                     ch="N";
                 }
                 a[i][j]+=;
             }
             if((a[i][j]&)){
                 memset(vis,,sizeof(vis));
                 ans=;
                 a[i][j]-=;
                 dfs(i,j);
                 if(ans>res){
                     res=ans;
                     x=i,y=j;
                     ch="";
                     ch="E";
                 }
                 a[i][j]+=;
             }
             if((a[i][j]&)){
                 memset(vis,,sizeof(vis));
                 ans=;
                 a[i][j]-=;
                 dfs(i,j);
                 if(ans>res){
                     res=ans;
                     x=i,y=j;
                     ch="";
                     ch="S";
                 }
                 a[i][j]+=;
             }
         }
     }
     cout<<res<<endl;
     cout<<x<<" "<<y<<" "<<ch<<endl;
 }