# Eddy's picture

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8871    Accepted Submission(s): 4516

Problem Description
Eddy begins to like painting pictures recently ,he is sure of himself to become a painter.Every day Eddy draws pictures in his small room, and he usually puts out his newest pictures to let his friends appreciate. but the result it can be imagined, the friends are not interested in his picture.Eddy feels very puzzled,in order to change all friends 's view to his technical of painting pictures ,so Eddy creates a problem for the his friends of you.
Problem descriptions as follows: Given you some coordinates pionts on a drawing paper, every point links with the ink with the straight line, causes all points finally to link in the same place. How many distants does your duty discover the shortest length which the ink draws?

Input
The first line contains 0 < n <= 100, the number of point. For each point, a line follows; each following line contains two real numbers indicating the (x,y) coordinates of the point.

Input contains multiple test cases. Process to the end of file.

Output
Your program prints a single real number to two decimal places: the minimum total length of ink lines that can connect all the points.

Sample Input
3 1.0 1.0 2.0 2.0 2.0 4.0

Sample Output
3.41

n个点的完全图，求最小生成树。

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
const int MAX = 105;
struct Node
{
double x, y;
}N[MAX];
struct Len
{
int nodex, nodey;
double len;
bool operator< (const Len a) const
{
return len < a.len;
}
}L[MAX*MAX];
double dis(Node a, Node b)
{
return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
int n, k, fa[MAX];
int fi(int x)
{
if(fa[x] == x) return x;
else return fa[x] = fi(fa[x]);
}
double ans;
int main()
{
while(scanf("%d", &n) != EOF)
{
k = 0;
ans = 0;
for(int i = 0;i <= MAX; ++i) fa[i] = i;
for(int i = 0;i < n; ++i)
{
scanf("%lf %lf", &N[i].x, &N[i].y);
for(int j = 0;j < i; ++j)
{
L[k].nodex = i;
L[k].nodey = j;
L[k++].len = dis(N[i], N[j]);
}
}
sort(L, L+k);
for(int i = 0;i < k; ++i)
{
int x = fi(L[i].nodex);
int y = fi(L[i].nodey);
if(x == y) continue;
fa[x] = y;
ans += L[i].len;
}
printf("%.2f\n", ans);
}
return 0;
}


（省赛快到了~主场作战，还是没底~~~）

#### Kruskal算法（贪心+并查集=最小生成树）

2016-04-16 17:34:35

#### HDU-1879 最小生成树（Kruskal）模板题

2017-07-18 21:24:09

#### HDU1102(最小生成树Kruskal算法)

2016-06-01 19:29:38

#### 最小生成树 kruskal算法+时间复杂度

2016-10-08 17:34:46

#### Python算法 Kruskal算法

2012-12-05 22:57:30

#### 数据结构：最小生成树--Kruskal算法

2014-08-07 11:45:37

#### 最小生成树Kruskal算法朴素版 C语言实现

2017-12-11 22:15:17

#### 最小生成树的Prim算法和Kruskal算法java代码实现

2016-09-17 21:31:33

#### 浅谈最小生成树的算法思路（二）Kruskal算法

2016-02-16 22:46:17

#### 最小生成树——Kruskal算法(C语言版)

2014-12-04 09:49:03

## 不良信息举报

HDU 1162.Eddy's picture【最小生成树（Kruskal算法）】【5月30】