大佬求调
#include<iostream>
using namespace std;
char map[1003][1003];
int main()
{
int n,m;
cin>>n>>m;
char faek='A'-1;
int x,y;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
cin>>map[i][j];
if(map[i][j]!='#')
{
if(map[i][j]>faek)
{
faek=map[i][j];
x=i;
y=j;
}
}
}
}
cout<<map[x][y];
int xx[]={0,-1,0,0,1};
int yy[]={0,0,-1,1,0};
char fak=(char)(0);
int ansx=-1,ansy=-1;
for(int i=1;i<=4;i++)
{
int nx=x+xx[i];
int ny=y+yy[i];
if(map[nx][ny]!='#'&&nx>=1&&nx<=n&&ny>=1&&ny<=m&&map[nx][ny]>fak)
{
fak=map[nx][ny];
ansx=nx;
ansy=ny;
}
}
if(ansx==ansy&&ansx==-1)return 0;
if(map[ansx][ansy]==map[x][y])return 0;
cout<<map[ansx][ansy];
return 0;
}