zoukankan      html  css  js  c++  java
  • Frogger

    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
    

    Hint

    #include <iostream>
    #include <iomanip>
    #include <cmath>
    using namespace std;
    class point
    {public:
    int x,y;}p[201];
    double pa[201][201];
    int main()
    {
    int t=1,n;
    while(cin>>n,n!=0)
    {int i,j,k;
    for(i=1;i<=n;i++)
    cin>>p[i].x>>p[i].y;
    for(i=1;i<=n-1;i++)
    for(j=i+1;j<=n;j++)
    {

    double x1=p[i].x-p[j].x; 
     double y1=p[i].y-p[j].y; 
    pa[i][j]=pa[j][i]=sqrt(x1*x1+y1*y1);

    }

    for(k=1;k<=n;k++)
    for(i=1;i<=n-1;i++)
    for(j=i+1;j<=n;j++)
    {
    if(pa[i][k]<pa[i][j] && pa[k][j]<pa[i][j])    
                            if(pa[i][k]<pa[k][j])           
                                pa[i][j]=pa[j][i]=pa[k][j]; 
                            else 
                                pa[i][j]=pa[j][i]=pa[i][k]; 


    }

    cout<<"Scenario #"<<t++<<endl; 

    cout<<fixed<<setprecision(3)<<"Frog Distance = "<<pa[1][2]<<endl<<endl; 

    }

    return 0;}

  • 相关阅读:
    超棒的微软Metro风格Logo设计
    免费资源:Polaris UI套件 + Linecons图标集(AI, PDF, PNG, PSD, SVG)
    11套免费的wordpress模板主题
    SASS(Syntactically Awesome Stylesheets Sass)绝对新手入门教程
    分享网页加载速度优化的一些技巧?
    帮助开发者快速创建响应式布局的Boilerplate Responsive Boilerplate
    免费素材: Retina Glyph图标集 (包含100个AI & PNG格式的图标)
    响应式的前端框架 Groundwork
    帮助你搜索免费矢量,图标和PSD的搜索引擎 Freepik
    Toolbar.Js 帮助你创建提示风格的工具条jQuery插件
  • 原文地址:https://www.cnblogs.com/lengxia/p/4387799.html
Copyright © 2011-2022 走看看