POJ 2560 Freckles 最小生成树 Kruskal+并查集使用

原创 2011年01月24日 20:45:00

http://poj.org/problem?id=2560

 

本题跟其他题差不多,只不过节点的权重需要自己计算
Freckles
Time Limit: 1000MS   Memory Limit: 65536K

Description

In an episode of the Dick Van Dyke show, little Richie connects the freckles on his Dad's back to form a picture of the Liberty Bell. Alas, one of the freckles turns out to be a scar, so his Ripley's engagement falls through. 
Consider Dick's back to be a plane with freckles at various (x,y) locations. Your job is to tell Richie how to connect the dots so as to minimize the amount of ink used. Richie connects the dots by drawing straight lines between pairs, possibly lifting the pen between lines. When Richie is done there must be a sequence of connected lines from any freckle to any other freckle.

Input

The first line contains 0 < n <= 100, the number of freckles on Dick's back. For each freckle, a line follows; each following line contains two real numbers indicating the (x,y) coordinates of the freckle.

Output

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

Sample Input

3
1.0 1.0
2.0 2.0
2.0 4.0

Sample Output

3.41
 

 

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

POJ 2560Freckles(并查集)

题意:找出一条最短路,额…….n

POJ2560 Freckles(prim最小生成树)

Freckles Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 7839   Accepted: 3763 ...

POJ 2560 Freckles 最小生成树

好久没有写过最小生成树的题了,碰到一道最小生成树的题,没想到竟然1A了,,,happy。用的是kruskal算法,比较简单的。题目: Freckles Time Limit...
  • wmn_wmn
  • wmn_wmn
  • 2012年04月12日 20:11
  • 1480

UVa10034/POJ2560_Freckles(最小生成树)(小白书图论专题)

解题报告 题意: 把所有点连起来,求使用的墨水最少。 思路: 裸最小生成树。 #include #include #include #include #define inf 0x3f3f3f3...

文章标题 POJ 2349:Arctic Network ( 最小生成树Kruskal算法+并查集)

Arctic NetworkDescriptionThe Department of National Defence (DND) wishes to connect several northern...

POJ1287 Networking (Kruskal与并查集求解最小生成树)

 Description You are assigned to design network connections between certain points in a wide are...

文章标题 POJ 2485 : Highways(最小生成树--kruskal+并查集)

HighwaysDescription The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no...

POJ - 1251 Jungle Roads (最小生成树Kruskal、并查集)

题目:http://poj.org/problem?id=1251 题意: n个村子,m

POJ2560_Freckles_最小生成树

- -刚开始我看输入把我下了一跳,平面上n个点怎么遍历啊。后来才发现自己二到忘记看规模了,n...... 然后就是裸的最小生成树的Kruskal算法 悲催的是自己连这个都没有一遍过对自己的水平无语了 ...

uva_10034 Freckles Kruskal (使用并查集) 或Prim

Kruskal   #include #include #include #define N 100 #define inf 1e200 using namespace std; dou...
  • whu_zxl
  • whu_zxl
  • 2012年07月18日 19:28
  • 245
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ 2560 Freckles 最小生成树 Kruskal+并查集使用
举报原因:
原因补充:

(最多只允许输入30个字)