hdu2612

题意：两个人想在一个kfc见面，问他们见面花费最小的时间；

分析：就是分别找他们到kfc的距离，然后就他们到每个kfc距离之和最小，即使所求，
用广搜，

总结：

#include<iostream>
#include<queue>
#include<cstdio>
#include<cstring>
using namespace std;
const int N = 210;
const int inf = 100000000;
int n, m, flag;
int dis[N][N][2], mark[N][N], dir[4][2] = {{1, 0}, {0, -1}, {0, 1}, {-1, 0}};
char s[N][N];
struct node
{
    int x, y, step;
};
void bfs(int x, int y)
{
    queue<node>q;
    node temp, type;
    temp.x = x;
    temp.y = y;
    temp.step = 0;
    q.push(temp);
    mark[x][y] = 1;

    while(!q.empty())
    {
        temp = q.front();
        q.pop();
        type.step = temp.step + 1;
        for(int i = 0; i < 4; i++)
        {
            type.x = x = temp.x + dir[i][0];
            type.y = y = temp.y + dir[i][1];
            if(x >= 0 && x < n && y >= 0 && y < m && mark[x][y] == 0 && s[x][y]!='#')
            {
                mark[x][y] = 1;
                if(s[x][y] == '@')
                     dis[x][y][flag] = type.step;
                q.push(type);
            }
        }
    }
}
int main()
{
    while(scanf("%d%d", &n, &m)!=EOF)
    {
        int min = inf;
        for(int i = 0; i < n; i++)
            for(int j = 0; j < m; j++)
            dis[i][j][0] = dis[i][j][1] = inf;
        for(int i = 0; i < n; i++)
            scanf("%s", s[i]);
            for(int i = 0; i < n; i++)
                for(int j = 0; j < m; j++)
            {
                if(s[i][j] == 'Y')
                {
                    flag = 0;
                    memset(mark, 0, sizeof(mark));
                    bfs(i, j);
                }
                if(s[i][j] == 'M')
                {
                    flag = 1;
                    memset(mark, 0, sizeof(mark));
                    bfs(i, j);
                }
            }
            for(int i = 0; i < n; i++)
                for(int j = 0; j < m; j++)
                if(s[i][j] == '@' && min > dis[i][j][0] + dis[i][j][1])
            {
                min = dis[i][j][0] + dis[i][j][1];
            }
            printf("%d\n", min*11);
    }
}