Fire Net

                                                                    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

PS：这道搜索题，说实话我感觉挺有意思的。题意就不说了，思路很明确，确保该点左侧和上面没有堡垒，或者有墙。我们可以将矩阵中的每一位置表示为pos。比如4*4,且看;

0   1   2    3

4   5   6    7

8   9  10  11

12 13 14 15

在搜索过程中，每次都寻找下一个pos，再判断即可，详情请看代码

代码：

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<math.h>
#include<map>
using namespace std;
const int N=1e6+10;
const int inf=999999999;
char mp[5][5];
int ans,n;
int check(int r,int c)//判断该点是否满足条件,if(flag)则满足条件
{
    int flag=1;
    for(int i=r; i>=0; i--)
    {
        if(mp[i][c]=='X') break;
        if(mp[i][c]=='b')
        {
            flag=0;
            break;
        }
    }
    for(int i=c; i>=0; i--)
    {
        if(mp[r][i]=='X') break;
        if(mp[r][i]=='b')
        {
            flag=0;
            break;
        }
    }
    return flag;
}
void dfs(int pos,int num)//pos为0.1.2.3....指每一个位置，num为点数
{
    int r=pos/n,c=pos%n;
    if(pos==n*n)
    {
        if(ans<num) ans=num;
        return ;
    }
//    printf("ans=%d num=%d\n",ans,num);
    if(mp[r][c]=='.')
    {
        if(check(r,c))
        {
            mp[r][c]='b';
            dfs(pos+1,num+1);
            mp[r][c]='.';
        }
    }
    dfs(pos+1,num);
}
int main()
{
    int i;
    while(~scanf("%d",&n)&&n)
    {
        memset(mp,0,sizeof(mp));
        for(i=0,ans=0; i<n; i++)
            scanf("%s",mp[i]);
        dfs(0,0);
        printf("%d\n",ans);
    }
    return 0;
}