uva-639-枚举

　题意：

象棋里的車可以吃横竖的車,题目加了一个墙,用于阻断攻击,问4x4的棋盘最多可以放多少只車,

思路:枚举每一个点,2^16次方种情况

#include<stdio.h>
#include<iostream>
#include<sstream>
#include<queue>
#include<map>
#include<memory.h>
#include <math.h>
#include<time.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
#define N 8
int m[N][N];
int vis[N];
int n;
int final = ;
void dfs(int curLine, int curCol, int num)
{
    if(curLine > n)
    {
        final = final < num ? num : final;
        return;
    }
    if(m[curLine][curCol] == )
    {
        if(curCol +  > n)
            dfs(curLine + , , num);
        else
            dfs(curLine, curCol + , num);
        return;
    }
    int ok = ;
    for(int i = curLine - ; i >= ; i--)
    {
        if(m[i][curCol] == )
            break;
        if(m[i][curCol] == )
        {
            ok = ;
            break;
        }
    }
    for(int i = curCol - ; i >= &&ok; i--)
    {
        if(m[curLine][i] == )
            break;
        if(m[curLine][i] == )
        {
            ok = ;
            break;
        }
    }
    if(ok)
    {
        m[curLine][curCol] = ;
        if(curCol +  > n)
            dfs(curLine + , , num + );
        else
            dfs(curLine, curCol + , num + );
        m[curLine][curCol] = ;
    }
    if(curCol +  > n)
        dfs(curLine + , , num);
    else
        dfs(curLine, curCol + , num);
}
 
int main(const int argc, char** argv)
{
    //freopen("d:\\1.txt", "r", stdin);
    while (cin >> n && n)
    {
        final = ;
        memset(vis, , sizeof(vis));
        memset(m, -, sizeof(m));
        char c;
        for(int i = ; i <= n; i++)
            for(int j = ; j <= n; j++)
            {
                cin >> c;
                if(c == 'X')
                    m[i][j] = ;
                else
                    m[i][j] = ;
            }
        dfs(, , );
        cout << final << endl;
    }
    return ;
}