코드 n = int(input()) graph = [list(input()) for _ in range(n)] ans = 1 def search(): global ans for i in range(n): cnt = 1 for j in range(1, n): if (graph[i][j-1]) == graph[i][j]: cnt += 1 ans = max(ans, cnt) else: cnt = 1 for j in range(n): cnt_2 = 1 for i in range(1, n): if (graph[i-1][j]) == graph[i][j]: cnt_2 += 1 ans = max(cnt_2, ans) else: cnt_2 = 1 for i in range(n): for j in range(n): if ..
