zoukankan      html  css  js  c++  java
  • POJ 2253 Frogger

    Frogger
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 19130   Accepted: 6222

    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
    -----------------------------------------------------------------------------------------------

    求两点间所有路径的最大跳跃距离的最小值

    dijkstra的变体


    #include <iostream>
    #include <cmath>
    #include <iomanip>
    #define OO 999999
    
    using namespace std;
    
    double mind;
    int n,p;
    double a[500][500];
    double d[500];
    int v[500];
    int ax[500];
    int ay[500];
    
    int main()
    {
        int loop=0;
        cout<<fixed;
        cout<<setprecision(3);
        while (cin>>n)
        {
            if (n==0) break;
            loop++;
            for (int i=0;i<n;i++)
            {
                cin>>ax[i]>>ay[i];
            }
            for (int i=0;i<n;i++)
            {
                for (int j=0;j<n;j++)
                {
                    a[i][j]=sqrt( (ax[i]-ax[j])*(ax[i]-ax[j])+(ay[i]-ay[j])*(ay[i]-ay[j]) );
                }
            }
            for (int i=0;i<n;i++)
            {
                d[i]=OO;
                v[i]=false;
            }
            d[0]=0;
            for (int i=0;i<n;i++)
            {
                mind=OO;
                for (int j=0;j<n;j++)
                {
                    if (!v[j]&&d[j]<mind)
                    {
                        mind=d[j];
                        p=j;
                    }
                }
                v[p]=true;
                for (int j=0;j<n;j++)
                {
                    if (!v[j]&&a[j][p]!=0)
                    {
                        if (d[j]>max(a[j][p],d[p]))
                        {
                            d[j]=max(a[j][p],d[p]);
                        }
                    }
                }
            }
            cout<<"Scenario #"<<loop<<endl;
            cout<<"Frog Distance = "<<d[1]<<endl;
            cout<<endl;
        }
        return 0;
    }
    


  • 相关阅读:
    HTTP 常见状态码
    SpringMVC 入门
    Maven 整合SSH框架
    SSH 框架整合总结
    Maven 整合SSH框架之pom.xml
    Maven 入门
    WebService 综合案例
    CXF 框架
    jQuery高级
    JavaScript补充:BOM(浏览器对象模型)
  • 原文地址:https://www.cnblogs.com/cyendra/p/3038406.html
Copyright © 2011-2022 走看看