{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003eFreddy 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\u0027 sunscreen, he wants to avoid swimming and instead reach her by jumping. \n\u003cbr\u003eUnfortunately Fiona\u0027s 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. \n\u003cbr\u003eTo execute a given sequence of jumps, a frog\u0027s jump range obviously must be at least as long as the longest jump occuring in the sequence. \n\u003cbr\u003eThe 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. \n\u003cbr\u003e\n\u003cbr\u003eYou are given the coordinates of Freddy\u0027s stone, Fiona\u0027s stone and all other stones in the lake. Your job is to compute the frog distance between Freddy\u0027s and Fiona\u0027s stone.\n\u003cbr\u003e\u003c/div\u003e\n\n\u003cbr\u003e翻译1:给出青蛙A,B和若干石头的坐标,现青蛙A想到青蛙B那,A可通过任意石头到达B,\n\n 问从A到B多条路径中的最长边中的最短距离\u003cbr\u003e翻译2:湖中有n块石头,编号从1到n,有两只青蛙,Bob在1号石头上,Alice在2号石头上,Bob想去看望Alice,但由于水很脏,他想避免游泳,于是跳着去找她。但是Alice的石头超出了他的跳跃范围。因此,Bob使用其他石头作为中间站,通过一系列的小跳跃到达她。两块石头之间的青蛙距离被定义为两块石头之间所有可能路径上的最小必要跳跃距离,某条路径的必要跳跃距离即这条路径中单次跳跃的最远跳跃距离。你的工作是计算Alice和Bob石头之间的青蛙距离。"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003eThe input will contain one or more test cases. The first line of each test case will contain the number of stones n (2\u0026lt;\u003dn\u0026lt;\u003d200). The next n lines each contain two integers xi,yi (0 \u0026lt;\u003d xi,yi \u0026lt;\u003d 1000) representing the coordinates of stone #i. Stone #1 is Freddy\u0027s stone, stone #2 is Fiona\u0027s stone, the other n-2 stones are unoccupied. There\u0027s a blank line following each test case. Input is terminated by a value of zero (0) for n. \u003c/div\u003e\n\n多实例输入\n先输入一个整数n表示石头数量,当n等于0时结束。\n接下来n行依次给出编号为1到n的石头的坐标xi , yi。\n2 \u003c\u003d n \u003c\u003d 200\n0 \u003c\u003d xi , yi \u003c\u003d 1000"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003eFor each test case, print a line saying \"Scenario #x\" and a line saying \"Frog Distance \u003d 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. \u003c/div\u003e\n\n先输出\"Scenario #x\", x代表样例序号。\n接下来一行输出\"Frog Distance \u003d y\", y代表你得到的答案。\n每个样例后输出一个空行。\n(ps:wa有可能是精度问题,g++不对可以用c++尝试,都不对就是代码问题)"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e2\n0 0\n3 4\n\n3\n17 4\n19 4\n18 5\n\n0\n\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003eScenario #1\nFrog Distance \u003d 5.000\n\nScenario #2\nFrog Distance \u003d 1.414\n\u003c/pre\u003e"}}]}