UVa苏丹的继承者

#include<stdio.h>
#include<string.h>
int graph[8][8];
int col[8];
int tl;
int biggest;
void dfs(int row)
{
	if(row == 8)
	{
		int sum = 0;
		for(int i=0; i < row; ++i)
		{
			sum += graph[i][col[i]];
		}
		if(sum > biggest)
			biggest = sum;
		return;
	}
	for(int i=0; i < 8; ++i)
	{
		bool ok = true;
		for(int j=0; j < row; ++j)
		{
			if(i == col[j] || (row+i) == j+col[j] || row-i == j-col[j])
			{
				ok = false;
				break;
			}
		}
		if(ok)
		{
			col[row] = i;
			dfs(row+1);
		}
	}
}
int main()
{
	//
	freopen("input.txt","r",stdin);
	scanf("%d", &tl);
	for(int i=0; i < tl; ++i)
	{
		for(int j=0; j < 8; ++j)
		{
			for(int k=0; k < 8; ++k)
			{
				scanf("%d", &graph[j][k]);
			}
		}
		biggest = 0;
		dfs(0);

		printf("%5d\n", biggest);
	}
}