习题7-15(uva-11882)

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int maxn = 16, Dir[4][2] = { {0,1},{0,-1} ,{1,0},{-1,0} };
char matrix[maxn][maxn],vis[maxn][maxn],vis2[maxn][maxn];
int r, c,steps[maxn * maxn];

string ans;

struct Node
{
	int x, y;
}node[maxn * maxn];

void GetMaxResult(string& input) {
	if (ans.size() < input.size() || (ans.size() == input.size() && ans < input))
		ans = input;
}
int GetRemainMax(int x, int y) {
	int front = 0, tail = 1,ret = 0;
	node[0].x = x;
	node[0].y = y;

	memmove(vis2, vis, sizeof(vis));
	Node temp;
	while (front < tail) {
		temp = node[front];
		for (int i = 0;i<4;i++)
		{
			int nx = temp.x + Dir[i][0];
			int ny = temp.y + Dir[i][1];
			if (nx >= 0 && nx < r && ny >= 0 && ny < c && matrix[nx][ny] != '#' && !vis2[nx][ny]) {
				node[tail].x = nx;
				node[tail++].y = ny;
				++ret;
				vis2[nx][ny] = 1;
			}
		}
		++front;
	}
	return ret;
}
void dfs(int x, int y, string &cur) {

	int l = GetRemainMax(x, y);
	if (l + cur.size() < ans.size()) return;
	if (l + cur.size() == ans.size() && (cur + "z") < ans) return;

	GetMaxResult(cur);
	for (int i = 0;i<4;i++)
	{
		int nx = x + Dir[i][0];
		int ny = y + Dir[i][1];
		if (nx >= 0 && nx < r && ny >= 0 && ny < c && matrix[nx][ny] != '#'&& !vis[nx][ny]) {
			vis[nx][ny] = 1;
			cur.push_back(matrix[nx][ny]);
			dfs(nx, ny, cur);
			cur.pop_back();
			vis[nx][ny] = 0;
		}
	}
}

int main()
{
	string cur;
	while (cin >> r >> c && r && c) {
		ans = "";
		memset(vis, 0, sizeof(vis));

		for (int i = 0; i < r; i++) {
			for (int j = 0; j < c; j++) {
				cin >> matrix[i][j];
			}
		}
		for (int i = 0; i < r; i++) {
			for (int j = 0;j<c;j++)
			{
				if(matrix[i][j] == '#') continue;
				cur = matrix[i][j];
				vis[i][j] = 1;
				dfs(i, j,cur);
				vis[i][j] = 0;
			}
		}
		cout << ans << endl;
	}
	return 0;
}