Problem A: Freckles UVA 10034 裸生成树

最新推荐文章于 2024-10-29 21:01:11 发布

转载最新推荐文章于 2024-10-29 21:01:11 发布 · 108 阅读

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/DreamHighWithMe/p/3370378.html

博客围绕Problem A: Freckles问题，将迪克的背视为平面，雀斑为(x,y)坐标点。要求告诉Richie连接雀斑点的方式以最小化墨水使用量，需保证任意雀斑点间有相连线。给出了输入、输出格式及示例，目标是输出连接所有雀斑点的最小墨水线总长。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem A: Freckles

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 input begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below. This line is followed by a blank line, and there is also a blank line between two consecutive inputs.

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

For each test case, the output must follow the description below. The outputs of two consecutive cases will be separated by a blank line.

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

1

3
1.0 1.0
2.0 2.0
2.0 4.0

Sample Output

3.41
prim算法解决即可

转载于:https://www.cnblogs.com/DreamHighWithMe/p/3370378.html