UVa 167 - The Sultan's Successors

传送门UVa 167 - The Sultan's Successors

很经典很经典的八皇后问题，用LRJ老师书上的程序就可以解决。

其实我是被上两题逼得，只能拿这题先充数了TAT。

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int vis[3][100], mmax;
int chess[100][100];

void DFS(int cur, int curSum);

int main()
{
    //freopen("input.txt", "r", stdin);
    int T, i, j;
    scanf("%d", &T);
    while (T--)
    {
        mmax = 0;
        memset(vis, 0, sizeof(vis));
        for (i = 0; i < 8; i++)
            for (j = 0; j < 8; j++)
                scanf("%d", &chess[i][j]);
        DFS(0, 0);
        printf("%5d\n", mmax);
    }
    return 0;
}

void DFS(int cur, int curSum)
{
    int i;
    if (cur == 8)
    {
        mmax = max(mmax, curSum);
        return;
    }
    for (i = 0; i < 8; i++)
    {
        if (!vis[0][i] && !vis[1][cur + i] && !vis[2][cur - i + 8])
        {
            vis[0][i] = vis[1][cur + i] = vis[2][cur - i + 8] = 1;
            DFS(cur + 1, curSum + chess[cur][i]);
            vis[0][i] = vis[1][cur + i] = vis[2][cur - i + 8] = 0;
        }
    }
}