#include <iostream>
#include <cstdio>
#include <queue>
#include <string.h>
using namespace std;
#define size 5
typedef struct map
{
char m[size][size];
int ncastle;
}Map;
queue <Map> Q;
void inputsline(Map& a,int line,int x,int y)
{
int newX=x;
while (newX <= line && a.m[newX][y] !='X')
{
a.m[newX++][y] ='S';
}
newX = x;
while (newX>0 && a.m[newX][y] !='X')
{
a.m[newX--][y] ='S';
}
int newY= y;
while (newY <= line && a.m[x][newY] !='X')
{
a.m[x][newY++] ='S';
}
newY = y;
while(newY>0 && a.m[x][newY]!='X')
{
a.m[x][newY--] ='S';
}
}
int main()
{
int nline;
while(scanf("%d%*c",&nline),nline)
{
Map newMap;
memset(newMap.m,0,sizeof(newMap.m));
int i ,j;
//int ncastle;
for(i = 1 ; i <= nline;i++)
{
for (j = 1 ; j <= nline ; j++)
scanf("%c",&newMap.m[i][j]);
getchar();
}
// 输入部分 //
newMap.ncastle = 0;
Q.push(newMap);
int maxcastle =0;
while (!Q.empty())
{
Map newMap2 = Q.front();
if(newMap2.ncastle>maxcastle) maxcastle = newMap2.ncastle;
int flag_map = 0;
//找到第一个未探测过 ,不是墙壁,
for(i = 1; i <= nline;i++)
{
for(j = 1;j <= nline;j++)
{
if(newMap2.m[i][j] == 'X') continue;
if(newMap2.m[i][j] == 'S') continue;
if(newMap2.m[i][j] == '.')
{
/*****加入不放的*******
*/
//把该位置标记为已访问
newMap2.m[i][j] = 'S';
Q.push(newMap2);
/*****加入放的********
*/
inputsline(newMap2,nline,i,j);
newMap2.ncastle++;
Q.push(newMap2);
flag_map =1;
break;
}
}
if(flag_map)break;
}
Q.pop();
}
printf("%d\n",maxcastle);
}
return 0;
}
zju1002
最新推荐文章于 2017-07-10 13:19:21 发布