Fire Net

Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall. 

A blockhouse is a small castle that has four openings through which to shoot. The four openings are facing North, East, South, and West, respectively. There will be one machine gun shooting through each opening. 

Here we assume that a bullet is so powerful that it can run across any distance and destroy a blockhouse on its way. On the other hand, a wall is so strongly built that can stop the bullets. 

The goal is to place as many blockhouses in a city as possible so that no two can destroy each other. A configuration of blockhouses is legal provided that no two blockhouses are on the same horizontal row or vertical column in a map unless there is at least one wall separating them. In this problem we will consider small square cities (at most 4x4) that contain walls through which bullets cannot run through. 

The following image shows five pictures of the same board. The first picture is the empty board, the second and third pictures show legal configurations, and the fourth and fifth pictures show illegal configurations. For this board, the maximum number of blockhouses in a legal configuration is 5; the second picture shows one way to do it, but there are several other ways. 

 

Your task is to write a program that, given a description of a map, calculates the maximum number of blockhouses that can be placed in the city in a legal configuration. 

 

Input

The input file contains one or more map descriptions, followed by a line containing the number 0 that signals the end of the file. Each map description begins with a line containing a positive integer n that is the size of the city; n will be at most 4. The next n lines each describe one row of the map, with a '.' indicating an open space and an uppercase 'X' indicating a wall. There are no spaces in the input file. 

 

Output

For each test case, output one line containing the maximum number of blockhouses that can be placed in the city in a legal configuration.

 

Sample Input

4 .X.. .... XX.. .... 2 XX .X 3 .X. X.X .X. 3 ... .XX .XX 4 .... .... .... .... 0

 

Sample Output

5 1 5 2 4

在一个矩阵上建炮塔，同一行和同一列上不能建两个炮塔，除非他们之间有墙壁。
现在问在这个矩阵中最多能建多少个炮塔

#include <iostream>
using namespace std;
const int MAX = 6;
int point[4][2] = {-1,0,0,-1,1,0,0,1};
int n;
char map[MAX][MAX];
int max1;
int judge(int mid_x,int mid_y)///mid_x，mid_y向四个方向扩展，看是否已经建了炮塔
{
    int i;
    int mark = 1;
    for(i=0;i<4;i++)
    {
        int x,y;
        x = mid_x;
        y = mid_y;
        while(1)
        {
            x = x + point[i][0];
            y = y + point[i][1];
            if( map[x][y] == '@')
            {
                mark = 0;
                break;
            }
            else
            {
                if(map[x][y] == 'X')
                {
                    break;
                }
                else
                {
                    if(x<1 || y<1 || x>n || y>n)
                    {
                        break;
                    }
                }
            }
        }
    }
    return mark;
}

void DFS(int rank)
{
    int i,j;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
        {
            if(map[i][j] == '.' && judge(i,j))
            {
                map[i][j] = '@';
                DFS(rank+1);
                map[i][j] = '.';
            }
        }
    }
    if(max1 < rank)
    {
        max1 = rank;
    }
    return ;
}
int main()
{
    while(cin>>n,n)
    {
        memset(map,0,sizeof(map));
        int i,j;
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=n;j++)
            {
                cin>>map[i][j];
            }
        }
        max1 = 0;
        DFS(0);
        cout<<max1<<endl;
    }
    return 0;
}

对方格的每个点记录下它上下左右四个方向所能覆盖的点的个数，

即因为你要放在这点上的话，那么这点的上下左右四个方向就不能再放了，当然碰到墙就打止

例如： 
4 
.X.. 
.... 
XX.. 
....
那么转化过来就是

2 0 5 5

5 4 7 7

0 0 5 5

4 4 7 7

就这样

然后对个数值进行从小到大排序，依次选择，选择了该点之后，那么它所覆盖的点都不能在被选择了，标记起来即可。

答案就是你所选择的点的个数