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

    Frogger
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 24618   Accepted: 7992

    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

    最短路径的变形。


    AC代码例如以下:


    #include<iostream>
    #include<cmath>
    #include<cstdio>
    #include<cstring>
    using namespace std;
    
    double max(double a,double b)
    {
        return a>b?a:b;
    }
    
    int main()
    {
        int n,b;
        int i,j,cas=0;
        double x[505],y[505],sx,sy,ex,ey,w[505][505],d[505],vis[505];
        while(cin>>n,n)
        {
            cas++;
            double ans;
            for(i=0;i<n;i++)
                {
                    cin>>x[i]>>y[i];
                }
            for(i=0;i<n;i++)
                for(j=0;j<=i;j++)
            {
                w[i][j]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
                w[j][i]=w[i][j];
            }
            memset(vis , 0, sizeof vis);
            for(i=0;i<n;i++)
            {
                if(i==0)
                    d[i]=0;
                 else d[i]=0xffffffff;
            }
            for(i=0;i<n;i++)
            {
                int a;double m=0xffffffff;
                for(j=0;j<n;j++)
                    if(!vis[j]&&d[j]<m)
                    {m=d[j];a=j;}
                vis[a]=1;
                if(a==1)
                    break;
                for(j=0;j<n;j++)
                {
                    ans=sqrt((x[a]-x[j])*(x[a]-x[j])+(y[a]-y[j])*(y[a]-y[j]));
                    if(!vis[j]&& d[j]>max(d[a],ans))
                    {
                        d[j]=max(d[a],ans);
                    }
                }
            }
            printf("Scenario #%d
    Frog Distance = %.3f
    
    ",cas,d[1]);
        }
        return 0;
    }



  • 相关阅读:
    C语言高速入口系列(七)
    数据结构:最小生成树--Prim算法
    poj2387-Til the Cows Come Home dijkstra获得水的问题
    iOS开展UI一片—简单的浏览器观看节目
    spark安装mysql与hive
    键入强力推进并解决强转
    华为u8800怎样root?
    用友ERP-U8最新破解(再次更新版本,附安装过程中的解决办法)
    Delphi 自带的那个 Hand 光标很难看?没关系,一行代码解决问题:
    阿里余额宝的来龙与去脉
  • 原文地址:https://www.cnblogs.com/jhcelue/p/7381466.html
Copyright © 2011-2022 走看看