poj2253

Language: Default Frogger Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 15954   Accepted: 5269 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<stdio.h> #include<string.h> #include<math.h> using namespace std; struct NODE { double x; double y; }; NODE node[200+1]; double map[200+1][200+1]; double mindistace[200+1]; bool visited[200+1]; double distances(NODE &n1,NODE&n2) { double x=(n1.x-n2.x)*(n1.x-n2.x); double y=(n1.y-n2.y)*(n1.y-n2.y); return sqrtf(x+y); } void dijkstra(int n) { int u=1; for(int i=1;i<=n;i++) { mindistace[i]=map[u][i]; } memset(visited,0,sizeof(visited)); for(int i=2;i<=n;i++) { visited[u]=1; for(int j=2;j<=n;j++) { if(!visited[j]) { double temp=max(mindistace[u],map[u][j]); mindistace[j]=min(temp,mindistace[j]); } } u=2; while(visited[u])u++; for(int j=u+1;j<=n;j++) { if(!visited[j]&&mindistace[u]>mindistace[j]) { u=j; } } } } int main() { //freopen("in.txt","r",stdin); int n; int time1=0; while(cin>>n,n) { time1++; for(int i=1;i<=n;i++) { cin>>node[i].x>>node[i].y; } for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { if(i==j)map[i][j]=0; else map[i][j]=distances(node[i],node[j]); } } dijkstra(n); cout<<"Scenario #"<<time1<<endl; printf("Frog Distance = %.3lf\n\n",mindistace[2]); } }