hdu 4584 Building bridges

水题

#include <cstdio>
#include <cstdlib>
struct node
{
    int x;
    int y;
};
node C[1605];
node H[1605];
int l_c,l_h;
int main()
{
    //freopen("in.txt","r",stdin);
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        if(!n&&!m) break;
        l_c=l_h=0;
        int x1,y1,x2,y2;
        int min=81;
        char ch;
        for(int i=0; i<n; ++i)
        {
            getchar();
            for(int j=0; j<m; ++j)
            {
                scanf("%c",&ch);
                if(ch=='C')
                {
                    C[l_c].x=i;
                    C[l_c].y=j;
                    ++l_c;
                }
                else if(ch=='H')
                {
                    H[l_h].x=i;
                    H[l_h].y=j;
                    ++l_h;
                }
            }
        }
        for(int i=0; i<l_h; ++i)
            for(int j=0; j<l_c; ++j)
                if(min>abs(H[i].x-C[j].x)+abs(H[i].y-C[j].y))
                {
                    x1=H[i].x;
                    y1=H[i].y;
                    x2=C[j].x;
                    y2=C[j].y;
                    min=abs(H[i].x-C[j].x)+abs(H[i].y-C[j].y);
                }
        printf("%d %d %d %d\n",x1,y1,x2,y2);
    }
    return 0;
}