洛谷—P1101 单词方阵

需要记录方向的深度优先搜索

#include<iostream>
using namespace std;
char map[200][200];
bool visit[200][200];
int go[8][2] = { {1,1},{-1,-1},{-1,0},{0,-1},{1,0},{0,1},{1,-1},{-1,1} };
int pos[7][2];
const char str[] = "yizhong";
int n;
void dfs(int depth,int x,int y,int direct)
{
	if (depth == 7)
	{
		for (int i = 0; i < 7; ++i)
			visit[pos[i][0]][pos[i][1]] = true;
		return;
	}
	for (int i = 0; i < 8; ++i)
	{
		if (depth != 1 && i != direct) continue;
		int temp1 = x + go[i][0], temp2 = y + go[i][1];
		if (temp1>=0&&temp1<n&&temp2>=0&&temp2<n&&map[temp1][temp2] == str[depth])
		{
			//cout << "depth:" << depth << endl;
			//cout << temp1 << ',' << temp2 << ','<<map[temp1][temp2]<<endl;
			pos[depth][0] = temp1;
			pos[depth][1] = temp2;
			dfs(depth + 1, temp1, temp2,i);
		}
	}
}
int main()
{
	cin >> n;
	for (int i = 0; i < n; ++i)
		cin >> map[i];
	for (int i = 0; i < n; ++i)
		for (int j = 0; j < n; ++j)
			if (map[i][j] == 'y') {
				pos[0][0] = i;
				pos[0][1] = j;
				//cout << i << ',' << j << endl;
				dfs(1, i, j,-1);
			}
	for (int i = 0; i < n; ++i, cout << endl)
		for (int j = 0; j < n; ++j)
			if (visit[i][j])
				cout << map[i][j];
			else
				cout << '*';
	return 0;
}