dfs1.cpp

#include <iostream>

using namespace std;
char map[25][25];
int R, C;
 
int bag[26];
int dx[4] = { -1, 0, 1, 0 };
int dy[4] = { 0, 1, 0, -1 };
int answer=0;
void DFS(int x, int y,int cnt) {
	
	bag[map[x][y] - 'A'] = 1;
	for (int i = 0; i < 4; i++) {
		int xx, yy;
		xx = x + dx[i]; //행 증가
		yy = y + dy[i]; //열 증가

		if ((xx >= 0 && xx <R) && (yy >=0 && yy < C) && (!bag[map[xx][yy] - 'A']))  // bag가 0이면 -->방문하지않음
		{
			DFS(xx, yy, cnt + 1);
		}

	}
	bag[map[x][y] - 'A'] = 0;
	if (answer < cnt) answer = cnt;
}
	
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);


	int T;
	cin >> T; //TC ->> t=3이면 세 개의 예시 만들어져야함

	for (int t = 0; t < T; ++t) {

		cin >> R >> C; //R >=1 C<=20

		for (int j = 0; j < R; j++) {
			string str;
			cin >> str;

			for (int i = 0; i < C; i++)
			{
				map[j][i] = str[i];
			}
		}

		DFS(0,0,1);
		cout << "#" << t + 1 << " " << answer << "\n"; //최댓값 index?
		answer = 0; //다음꺼에선 해제 
	}
	return 0;
}