LETTERS （信息学奥赛一本通-T1212）

code:

#include <iostream>
using namespace std;
const int N = 110;
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
int st[N];	//用字符的ASCII值来表示它的状态
char g[N][N];

int n, m, maxx = 0;

void dfs(int x, int y, int cnt)
{
	maxx = max(maxx, cnt);
	
	for(int i = 0; i < 4; i ++ )
	{
		int nx = x + dx[i], ny = y + dy[i];
		if(nx >= 0 && nx < n && ny >= 0 && ny < m && st[g[nx][ny]] == 0)
		{
			st[g[nx][ny]] = 1;
			dfs(nx, ny, cnt + 1);
			st[g[nx][ny]] = 0;
		}
	}
}

int main()
{
	cin >> n >> m;
	
	for(int i = 0; i < n; i ++ )
		for(int j = 0; j < m; j ++ )
			cin >> g[i][j];
	
	st[g[0][0]] = 1;
	dfs(0, 0, 1);
	cout << maxx << endl;
	return 0;
}