大家好,又见面了,我是全栈君,今天给大家准备了Idea注册码。
解决报告
意甲冠军:
乞讨0至1所有最大的道路值的最小数量。
思维:
floyd。
#include <iostream> #include <cstdio> #include <cstring> #include <cmath> #define inf 0x3f3f3f3f using namespace std; int n,m,q; double mmap[210][210]; struct node { double x,y; } p[210]; double dis(node p1,node p2) { return sqrt((p1.x-p2.x)*(p1.x-p2.x)+(p1.y-p2.y)*(p1.y-p2.y)); } void floyd() { for(int k=0; k<n; k++) for(int i=0; i<n; i++) for(int j=0; j<n; j++) mmap[i][j]=min(mmap[i][j],max(mmap[i][k],mmap[k][j])); } int main() { int i,j,u,v,w,k=1; while(~scanf("%d",&n)) { if(!n)break; for(i=0; i<n; i++) { for(j=0; j<n; j++) mmap[i][j]=(double)inf; mmap[i][i]=0; } for(i=0; i<n; i++) { scanf("%lf%lf",&p[i].x,&p[i].y); } for(i=0; i<n; i++) { for(j=0; j<n; j++) { mmap[i][j]=dis(p[i],p[j]); } } floyd(); printf("Scenario #%d\n",k++); printf("Frog Distance = %.3lf\n",mmap[0][1]); printf("\n"); } return 0; }
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 25958 | Accepted: 8431 |
Description
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
Output
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
发布者:全栈程序员-用户IM,转载请注明出处:https://javaforall.cn/116705.html原文链接:https://javaforall.cn
【正版授权,激活自己账号】: Jetbrains全家桶Ide使用,1年售后保障,每天仅需1毛
【官方授权 正版激活】: 官方授权 正版激活 支持Jetbrains家族下所有IDE 使用个人JB账号...