zoukankan      html  css  js  c++  java
  • POJ 2253 Frogger 【Floyd】

    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 37902   Accepted: 12199

    Description

    Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and full of tourists' sunscreen, he wants to avoid swimming and instead reach her by jumping. 
    Unfortunately Fiona's stone is out of his jump range. Therefore Freddy considers to use other stones as intermediate stops and reach her by a sequence of several small jumps. 
    To execute a given sequence of jumps, a frog's jump range obviously must be at least as long as the longest jump occuring in the sequence. 
    The frog distance (humans also call it minimax distance) between two stones therefore is defined as the minimum necessary jump range over all possible paths between the two stones. 

    You are given the coordinates of Freddy's stone, Fiona's stone and all other stones in the lake. Your job is to compute the frog distance between Freddy's and Fiona's stone. 

    Input

    The input will contain one or more test cases. The first line of each test case will contain the number of stones n (2<=n<=200). The next n lines each contain two integers xi,yi (0 <= xi,yi <= 1000) representing the coordinates of stone #i. Stone #1 is Freddy's stone, stone #2 is Fiona's stone, the other n-2 stones are unoccupied. There's a blank line following each test case. Input is terminated by a value of zero (0) for n.

    Output

    For each test case, print a line saying "Scenario #x" and a line saying "Frog Distance = y" where x is replaced by the test case number (they are numbered from 1) and y is replaced by the appropriate real number, printed to three decimals. Put a blank line after each test case, even after the last one.

    Sample Input

    2
    0 0
    3 4
    
    3
    17 4
    19 4
    18 5
    
    0
    

    Sample Output

    Scenario #1
    Frog Distance = 5.000
    
    Scenario #2
    Frog Distance = 1.414
    

    Source


    这个不是让求最短距离,而是两个之间所有路径中每个路径长度最大的最小值,用Floyd进行变形就可以解决。

    又及:poj G++是过不了的(C++才可以)

    #include <map>
    #include <set>
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    #include <queue>
    #include <iostream>
    #include <stack>
    #include <cmath>
    #include <string>
    #include <vector>
    #include <cstdlib>
    //#include <bits/stdc++.h>
    #define space " "
    using namespace std;
    //typedef long long LL;
    typedef __int64 Int;
    typedef pair<int,int> paii;
    const int INF = 0x3f3f3f3f;
    const double ESP = 1e-5;
    const double Pi = acos(-1.0);
    const int MOD = 1e9 + 7;
    const int MAXN = 200 + 10;
    double dist[MAXN][MAXN];
    struct node{
        double x, y;
    } a[MAXN];
    double dis(node a, node b) {
        return sqrt((a.x - b.x)*(a.x - b.x) + (a.y - b.y)*(a.y - b.y));
    }
    int main() {
        int cnt = 0, n;
        while (scanf("%d", &n), n) {
            for (int i = 0; i < n; i++) {
                scanf("%lf%lf", &a[i].x, &a[i].y);
            }
            for (int i = 0; i < n; i++) {
                for (int j = i + 1; j < n; j++) {
                    dist[i][j] = dist[j][i] = dis(a[i], a[j]);
                }
            }
            for (int k = 0; k < n; k++) {
                for (int i = 0; i < n - 1; i++) {
                    for (int j = i + 1; j < n; j++) {
                        if (dist[i][j] > dist[i][k] && dist[i][j] > dist[j][k]) {
                            dist[i][j] = dist[j][i] = max(dist[i][k], dist[j][k]);
                        }
                    }
                }
            }
            printf("Scenario #%d
    ", ++cnt);
            printf("Frog Distance = %.3lf
    
    ", dist[0][1]);
        }
        return 0;
    }



  • 相关阅读:
    自动支持图片webp格式压缩,图片服务器升级webserver
    长江商学院介绍及名人校友名单
    恒大许家印靠斗着地主,当上首富
    用GitLab搭建自己的私有GitHub
    vim快速定位到某一行的几种方法和显示行号,定位匹配字符串,显示当前行信息的命令
    mysql数据库表上百万记录优化思路杂谈
    Java打印输出数组的三种方式:传统的for循环方式,for each循环,利用Arrays类中的toString方法
    个人快速成长之系统方法,最小化成长系统
    程序员应该了解的常见软件开发定律
    用python修改文件内容修改txt内容的3种方法
  • 原文地址:https://www.cnblogs.com/cniwoq/p/6770802.html
Copyright © 2011-2022 走看看