167 - The Sultan's Successors 回溯

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cctype>
#include <cstdlib>
#define MAX 8

using namespace std;

int Vis[3][100];
int Q[MAX][MAX];
int MM;
int row[MAX];

void search(int cur)
{
    if(cur == MAX)
    {
       int temp = 0;
       for(int i = 0;i < MAX;i++)
        temp += Q[i][row[i]] ;

       if(MM < temp)
        MM = temp;

       return;
    }

    for(int i = 0;i < MAX;i++)
    {
        if(!Vis[0][i] && !Vis[1][cur+i] && !Vis[2][cur-i+MAX])//0 line 1 fu duijiao 2 zhuduijiao
        {
            row[cur] = i;

            Vis[0][i] = Vis[1][cur+i] = Vis[2][cur-i+MAX] = 1;
            search(cur+1);
            Vis[0][i] = Vis[1][cur+i] = Vis[2][cur-i+MAX] = 0;
        }
    }

}

int main()
{
    int test_case;
    cin>>test_case;
    while(test_case--)
    {

        memset(Vis,0,sizeof(Vis));

        MM = 0;

        for(int i = 0;i < MAX;i++)
         for(int j = 0;j < MAX;j++)
          cin>>Q[i][j];

        search(0);
        printf("%5d\n",MM);
    }
    return 0;
}