1874哞加密

include[HTML_REMOVED]

include[HTML_REMOVED]

using namespace std;

const int N = 55;
typedef pair[HTML_REMOVED] PII;

int n, m, ans;
char a[N][N];
map[HTML_REMOVED] q;
int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1};
int dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};
void dfs(int x, int y)
{
for (int i = 0; i < 8; i)
{
int x1 = x + dx[i], y1 = y + dy[i];
int x2 = x1 + dx[i], y2 = y1 + dy[i];
if(~x1 && x1 < n && ~x2 && x2 < n && ~y1 && y1 < m && ~y2 && y2 < m)
if(a[x][y] != a[x1][y1] && a[x1][y1] == a[x2][y2])
q[{a[x][y],a[x1][y1]}] ;
}
}
int main()
{
scanf(“%d%d”,&n, &m);
for (int i = 0; i < n; i) scanf(“%s”, &a[i]);
for (int i = 0; i < n; i)
for (int j = 0; j < m; ++ j)
dfs(i, j);
for (auto &[x,v] : q)
if (x.first != ‘M’ && x.second != ‘O’) ans = max(ans, v);
printf(“%d”,ans);
return 0;
}