POJ_2253(最短路问题变形)
来源:互联网 发布:中易智联软件多少钱 编辑:程序博客网 时间:2024/04/30 09:43
Frogger
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 19919 Accepted: 6460
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.
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
20 03 4317 419 418 50
Sample Output
Scenario #1Frog Distance = 5.000Scenario #2Frog Distance = 1.414
题目意思大体就是找一条路,这条路中每一跳都尽量的小。找到这条路中最大的边。。开始没看懂意思。。得加强看英语题目的能力!!!!
#include "stdio.h"#include<algorithm>#include<cmath>using namespace std;const int maxV = 1001;const int maxE = 2001;const int maxLen = 999999;int n;double dist[maxV];double length[maxV][maxV];int i,j;struct node{int x;int y;};node dot[1000];double Dijkstra(){bool s[maxV];for(i=1;i<=n;++i){s[i]=0;dist[i]=length[1][i];}s[1]=1;dist[1]=0;double max = 0;for(i=2;i<=n;++i){double temp = maxLen;int u = 1;for(j=1;j<=n;++j){if(!s[j]&&dist[j]<temp){u = j ;temp = dist[j];}}if(temp>max)max = temp;if(u==2)return max;s[u]=1;for(j=1;j<=n;j++){if(!s[j]&&dist[j]>length[u][j])dist[j]=length[u][j];}}}int main(int argc, char* argv[]){int a,b;int count=1;//FILE *fp = freopen("data.txt","r",stdin);while(scanf("%d",&n)!=EOF){if(n==0) break;for(i=1;i<=n;i++)for(j=1;j<=n;j++)length[i][j]=maxLen;for(i=1 ; i<=n;i++){scanf("%d%d",&a,&b);dot[i].x=a;dot[i].y=b;}for(i=1;i<=n;i++)for(j=1;j<=n;j++)length[i][j]=sqrt((dot[i].x-dot[j].x)*(dot[i].x-dot[j].x)+(dot[i].y-dot[j].y)*(dot[i].y-dot[j].y));printf("Scenario #%d\nFrog Distance = %.3f\n\n",count++,Dijkstra());}return 0;}
- POJ_2253(最短路问题变形)
- poj_2253 最短路floyd
- Poj_2253 Frogger(最短路-SPFA+Dijkstra)
- hdu1596(最短路变形)
- 最短路问题,多源、SPFA变形
- hdu 4360(最短路变形)
- uva 10246(最短路变形)
- POJ-1797(最短路的变形)
- poj1797 Heavy Transportation(最短路变形)
- poj1797 Heavy Transportation(最短路变形)
- poj1724--ROADS(最短路变形)
- POJ 2253 Frogger(最短路变形)
- Heavy Transportation(最短路变形)
- poj2253 - Frogger(最短路变形)
- 最短路的变形(hdu 4725)
- poj-ROADS(最短路变形)
- POJ2253---Frogger(最短路变形)
- POJ1797---Heavy Transportation(最短路变形)
- 二分法排序算法
- linux 配置网络/sbin/ifup: configuration for eth0 not found
- 编码与解码(数论中的计数问题) By ACReaper
- 离散概率初步 By ACReaper
- tomcat配置双向认证,客户端证书pkcs12格式,方便导入浏览器
- POJ_2253(最短路问题变形)
- 使用Lua CJSON库进行encode与decode操作完成对Json数据转化
- HMM学习2之前向算法(转)
- poj 1144
- 受限的操作下迭代技巧之一道腾讯笔试题
- IOS 常用的宏定义(一)
- Java DataBase Connection
- 浏览器内核分析
- 日历函数