洛谷 P1123 取数游戏

#include <iostream>

using namespace std;

int n;
int m;
int t;
int re[100];
int num[10][10];
int use[10][10];
int ans = 0;

void dfs(int x, int y,int s)
{
	if (x > n)// over
	{
		if (ans < s)
		{
			ans=s;
		}
		return;
	}
	int xx;
	int yy;
	xx = x;
	yy = y + 1;
	if (yy > m)
	{
		xx++;
		yy = 1;
	}
	//选择这个点
	if (!use[x - 1][y - 1] && !use[x - 1][y] && !use[x - 1][y + 1] && !use[x][y - 1])//只有左上可能有
	{
		use[x][y] = 1;
		dfs(xx, yy, s+num[x][y]);
		use[x][y] = 0;
	}
	//不选择
	dfs(xx, yy, s);
}


int main()
{
	cin >> t;
	int p = 0;
	while (++p <= t)
	{
		cin >> n >> m;
		for (int i = 1; i <= n; i++)
		{
			for (int j = 1; j <= m; j++)
			{
				cin >> num[i][j];
			}
		}
		dfs(1, 0, 0);
		re[p] = ans;
		ans = 0;
		for (int i = 1; i <= n; i++)
		{
			for (int j = 1; j <= m; j++)
			{
				num[i][j] = 0;
				use[i][j] = 0;
			}
		}
		
	}
	for (int i = 1; i <= t; i++)
	{
		cout << re[i] << endl;
	}
}