剑鱼行动
Time Limit:10000MS Memory Limit:65536K
Total Submit:99 Accepted:84
Case Time Limit:1000MS
Description
给出N个点的坐标,对它们建立一个最小生成树,代价就是连接它们的路径的长度,现要求总长度最小。N的值在100以内,坐标值在[-10000,10000].结果保留二位小数
Input
5 ---------------5个点
0 0 ---------------5个点点的坐标
0 1
1 1
1 0
0.5 0.5
Output
2.83
var
map:array[0..101,0..101]of real;
x,y:array[0..101]of real;
dis:array[0..101]of longint;
i,j,n,t,k,ci,cj:longint;
min,ans:real;
begin
readln(n);
for i:=1 to n do
begin
read(x[i],y[i]);
dis[i]:=i;
end;
for i:=1 to n do
for j:=1 to n do
begin
if i<>j then
map[i,j]:=sqrt(sqr(x[i]-x[j])+sqr(y[i]-y[j]));
end;
for k:=1 to n-1 do
begin
min:=maxlongint;
for i:=1 to n do
for j:=1 to n do
if (dis[i]<>dis[j])and(map[i,j]<min)and(map[i,j]<>0) then
begin
min:=map[i,j];
ci:=i;
cj:=j;
end;
ans:=ans+min;
t:=dis[cj];
for i:=1 to n do if dis[i]=t then dis[i]:=dis[ci];
end;
write(ans:0:2);
end.