Frogger
改一下松弛写法:
dis[j] = min(dis[j],max(dis[k],get_dis(p[k],p[j]))); //dis[j]为从一号石头到第j号石头所有通路中最长边中的最小边
看评论提醒要么输出写%.3f,要么编译环境选C++,不然写%.3lf就卡,我也不知道为什么...
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstring>
#include <set>
#include <map>
#include <queue>
#include <cstdio>
#include <cmath>
using namespace std;
const int maxn =1e3+10;
const int inf = 0x3f3f3f3f;
double dis[maxn];
int vis[maxn];
int a,b,t;
typedef struct {
int x,y;
}node;
node p[maxn];
double get_dis(node a,node b)
{
return sqrt((a.x-b.x)*(a.x-b.x) +(a.y-b.y)*(a.y-b.y));
}
void dijkstra(int x)
{
memset(vis,0,sizeof(vis));
for(int i = 0;i <t;i++)
{
dis[i] = get_dis(p[x],p[i]);
}
vis[x] = 1;
dis[x] = 0;
for(int i =0;i< t-1;i++)
{
double minl = inf;
int k=-1;
for(int j = 0;j < t;j++)
{
if(!vis[j] && dis[j] < minl)
{
minl = dis[j];
k = j;
}
}
if(k==-1)break;
vis[k] = 1;
for(int j=0;j < t;j++)
{
dis[j] = min(dis[j],max(dis[k],get_dis(p[k],p[j])));//修改
}
}
}
int main()
{
int tmp=0;
while(scanf("%d",&t) && t)
{
tmp++;
memset(dis,inf, sizeof(dis));
for(int i = 0;i < t;i++)
{
scanf("%d%d",&a,&b);
p[i].x = a;
p[i].y = b;
}
dijkstra(0);
printf("Scenario #%d\n",tmp);
printf("Frog Distance = %.3lf\n\n",dis[1]);
}
return 0;
}