DFS-递归与回溯之The Sultan‘s Successors

题目：

The Sultan of Nubia has no children, so she has decided that the country will be split into up to k
separate parts on her death and each part will be inherited by whoever performs best at some test. It
is possible for any individual to inherit more than one or indeed all of the portions. To ensure that
only highly intelligent people eventually become her successors, the Sultan has devised an ingenious
test. In a large hall filled with the splash of fountains and the delicate scent of incense have been
placed k chessboards. Each chessboard has numbers in the range 1 to 99 written on each square and is
supplied with 8 jewelled chess queens. The task facing each potential successor is to place the 8 queens
on the chess board in such a way that no queen threatens another one, and so that the numbers on
the squares thus selected sum to a number at least as high as one already chosen by the Sultan. (For
those unfamiliar with the rules of chess, this implies that each row and column of the board contains
exactly one queen, and each diagonal contains no more than one.)
Write a program that will read in the number and details of the chessboards and determine the
highest scores possible for each board under these conditions. (You know that the Sultan is both a
good chess player and a good mathematician and you suspect that her score is the best attainable.)

输入：

Input will consist of k (the number of boards), on a line by itself, followed by k sets of 64 numbers,
each set consisting of eight lines of eight numbers. Each number will be a positive integer less than
100. There will never be more than 20 boards.

输出：

Output will consist of k numbers consisting of your k scores, each score on a line by itself and right
justified in a field 5 characters wide.

输入样例：

1
1 2 3 4 5 6 7 8
9 10 11 12 13 14 15 16
17 18 19 20 21 22 23 24
25 26 27 28 29 30 31 32
33 34 35 36 37 38 39 40
41 42 43 44 45 46 47 48
48 50 51 52 53 54 55 56
57 58 59 60 61 62 63 64

输出样例：

260

题解题意及代码：

其实就是八皇后问题的升级，本题在八皇后要求每行有一个皇后，而且每行的皇后都不能在同行同列和斜对的基础上要求在8*8的图上都会有一个数，要求出皇后在满足八皇后的基础上，底数的和最大为多少。

---

这道题的思路就是dfs的深搜遍历出，所有摆好8行的皇后情况，以及他们的底数和。然后比较，选出最大的那个。

#include<bits/stdc++.h>
using namespace std;
const int maxn=10;
int tot,n;//tot是记录当前这个八皇后的底数和。
//n测试几组样例
int vis[maxn][maxn];//用于标记
int fmap[maxn][maxn];//存图
//判断皇后的位置是否合适的judge函数
int judge(int x,int y) {
	//上一行是否有其他皇后
	for(int i=x-1; i>=1; i--) {
		if(vis[i][y]) return 0;
	}
	//同一行是否有其他皇后
	for(int i=y-1; i>=1; i--) {
		if(vis[x][i]) return 0;
	}
	//对角线上是否有其他皇后
	for(int i=1; i<=8; i++) {
		for(int j=1; j<=8; j++) {
			if(abs(i-x)==abs(j-y)) {
				if(vis[i][j]) return 0;
			}
		}
	}
	return 1;
}
void dfs(int i,int fmax) {
	if(i>8) {//如果大于等于8那么已经放好了八个皇后 
		if(fmax>tot) tot=fmax;
		return;
	}
	for(int j=1;j<=8;j++){//第一行遍历过去找到所有能满足的点 
		if(vis[i][j]==0&&judge(i,j)){
			vis[i][j]=1;
			dfs(i+1,fmax+fmap[i][j]);//递归到下一行 
			vis[i][j]=0;//重新再找另一个位置另一种情况直到找到所有情况 
		}
	}
}
//主函数
int main(){
	scanf("%d",&n);
	while(n--){//存图 
		memset(vis,0,sizeof(vis));
		memset(fmap,0,sizeof(fmap));
		for(int i=1;i<=8;i++){
			for(int j=1;j<=8;j++){
				scanf("%d",&fmap[i][j]);
			}
		}
		tot=0;
		dfs(1,0);
		printf("%5d\n",tot);
	}
	return 0;
}