-
Notifications
You must be signed in to change notification settings - Fork 0
/
00534.cpp
66 lines (66 loc) · 1.54 KB
/
00534.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include <iostream>
#include <algorithm>
#include <cstring>
#include <math.h>
#include <iomanip>
using namespace std;
float dijsktra(float stone[][205],int n)
{
bool *visit=new bool[n];
float *dis=new float[n];
memset(visit,false,sizeof(bool)*n);
for(int i=0;i<n;i++)
{
dis[i]=stone[0][i];
}
visit[0]=true;
for(int i=0;i<n-1;i++)
{
int minN(3000000.0),w(-1);
for(int j=1;j<n;j++)
{
if(!visit[j]&&minN>dis[j])
{
w=j;
minN=dis[j];
}
}
visit[w]=true;
for(int j=0;j<n;j++)
{
if(!visit[j])
{
if(dis[j]>max(dis[w],stone[w][j]))
{
dis[j]=max(dis[w],stone[w][j]);
}
}
}
}
float ans=dis[1];
delete []dis;
delete []visit;
return ans;
}
int main()
{
float stone[205][205],x[205],y[205];
int times,kase(0);
while(cin>>times&×)
{
for(int i=0;i<times;i++)
{
cin>>x[i]>>y[i];
stone[i][i]=0.0;
for(int j=0;j<i;j++)
{
float disx=x[i]-x[j];
float disy=y[i]-y[j];
stone[i][j]=stone[j][i]=sqrt(disx*disx+disy*disy);
}
}
cout<<"Scenario #"<<++kase<<endl;
cout<<"Frog Distance = "<<fixed<<setprecision(3)<<dijsktra(stone,times)<<endl<<endl;
}
return 0;
}