不解释
Program:
#include<iostream>
#include<stdio.h>
#include<cmath>
#include<queue>
#include<stack>
#include<string.h>
#include<map>
#include<set>
#include<algorithm>
#define oo 100007
#define MAXN 100005
using namespace std;
char s[50][50];
int main()
{
int n,m,i,j,x1,x2,y1,y2,ax1,ay1,ax2,ay2,ans;
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
while (~scanf("%d%d",&n,&m) && n && m)
{
ans=oo;
for (i=0;i<n;i++) scanf("%s",s[i]);
for (y1=0;y1<n;y1++)
for (x1=0;x1<m;x1++)
if (s[y1][x1]=='H')
for (y2=0;y2<n;y2++)
for (x2=0;x2<m;x2++)
if (s[y2][x2]=='C')
if (abs(x1-x2)+abs(y1-y2)<ans)
{
ans=abs(x1-x2)+abs(y1-y2);
ax1=x1,ax2=x2,ay1=y1,ay2=y2;
}
printf("%d %d %d %d\n",ay1,ax1,ay2,ax2);
}
return 0;
}
