POJ-2253-Frogger [最短路][Dijkstra]

---

题目传送门

---

题意:输入一些石头的坐标，求从1号石头到2号石头的青蛙距离。（青蛙距离：最短路径上的最长跳跃距离）

思路:Dijkstra算法的变形，每次更新dis数组时用dis[j] = max(dis[f], mp[f][j])来求青蛙距离。

#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <queue>
#include <map>
#include <set>

using namespace std;

int n, t;
struct node{
    int x, y;
}point[210];
double mp[210][210];
const double inf = 0x3f3f3f3f;
void init()
{
    t++;
    for (int i = 0; i <= 200; i++)
        for (int j = 0; j <= 200; j++)
            mp[i][j]=inf;
    return;
}
double Dis(int a, int b)
{
    double px = 1.0*(point[a].x-point[b].x)*(point[a].x-point[b].x);
    double py = 1.0*(point[a].y-point[b].y)*(point[a].y-point[b].y);
    return sqrt(px+py);
}
void dij(int x)
{
    double dis[210];
    int book[210];
    memset(book,0,sizeof(book));
    for (int i = 1; i <= n; i++)
        dis[i] = mp[x][i];
    book[x] = 1;
    for (int i = 1; i < n; i++)
    {
        double mi = inf;
        int f = -1;
        for (int j = 1; j <= n; j++)
        {
            if (!book[j] && dis[j]<mi)
            {
                mi = dis[j];
                f = j;
            }
        }
        if (f==-1)
            break;
        book[f] = 1;
        for (int j = 1; j <= n; j++)
        {
            if (!book[j] && dis[j]>max(dis[f],mp[f][j]))
            {
                dis[j] = max(dis[f], mp[f][j]);
            }
        }
    }

    printf("Scenario #%d\nFrog Distance = %.3f\n\n", t, dis[2]);
    return ;
}
int main(void)
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);

    t = 0;
    while (scanf("%d", &n),n)
    {
        init();
        for (int i = 1; i <= n; i++)
            scanf("%d %d", &point[i].x, &point[i].y);
        for (int i = 1; i <= n; i++)
        {
            for (int j = i+1; j <= n; j++)
                mp[i][j] = mp[j][i] = Dis(i,j);
        }
        dij(1);
    }
    return 0;
}