题目1144:Freckles
来源:互联网 发布:批量注册淘宝账号 编辑:程序博客网 时间:2024/05/21 00:46
- 题目描述:
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.
- 输入:
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.
- 输出:
Your program prints a single real number to two decimal places: the minimum total length of ink lines that can connect all the freckles.
- 样例输入:
31.0 1.02.0 2.02.0 4.0
- 样例输出:
3.41
代码:
#include <stdio.h>#include <math.h>#include <algorithm>using namespace std;int tree[100];int findRoot(int x) { if(tree[x] == -1) return x; else {int tmp = findRoot(tree[x]);tree[x] = tmp;return tmp; }}struct Edge { int a; int b; double d;}edge[5000];struct Point { double x; double y; double getDist(Point A) {double tmp = (x - A.x) * (x - A.x) + (y - A.y) * (y - A.y);return sqrt(tmp); }}point[100];bool cmp(Edge A, Edge B) { return A.d < B.d;}int main() { int n; while(scanf("%d",&n)!=EOF) {for(int i=1;i<=n;i++) scanf("%lf %lf",&point[i].x,&point[i].y);int size = 0;for(int i=1;i<=n;i++) //把所有点都连接起来构成许多边 for(int j=i+1;j<=n;j++) {edge[size].a = i;edge[size].b = j;edge[size].d = point[i].getDist(point[j]);size++; }sort(edge,edge+size,cmp);for(int i=1;i<=n;i++) tree[i] = -1;double sum = 0;for(int i=0;i<size;i++) { int x = findRoot(edge[i].a); int y = findRoot(edge[i].b); if(x!=y) {tree[x] = y;sum += edge[i].d; }}printf("%.2lf\n",sum); } return 0;}
- 题目1144:Freckles
- 题目1144:Freckles
- 题目1144:Freckles
- Jobdu 题目1144:Freckles
- 题目1144:Freckles
- 九度 题目1144:Freckles
- 九度 题目1144:Freckles
- 九度oj 题目1144:Freckles
- 九度OJ题目1144:Freckles
- 题目72:Freckles
- 题目1144:Freckles(2009年北京大学计算机研究生机试真题)
- 【九度OJ】题目1144:Freckles 解题报告
- 九度 OJ 题目1144:Freckles (kruskal算法 最小生成树)
- Freckles
- Freckles
- 九度OJ-1144:Freckles
- 九度OJ——1144Freckles
- poj_2560 Freckles
- Android_关于子控件和父控件的事件响应问题
- 关于共享内存的利用
- GDI/GDI+ 绘制网站流量统计报表 总结(4)
- CXF-HelloWorld-服务端
- java_Hashtable实例
- 题目1144:Freckles
- ORM框架Hibernate (一) 对DAO封装和抽象
- wso2esb源码编译总结
- DbUtils
- MySQL修改密码
- NServiceBus翻译之持久化技术(四):How To Debug RavenDB Through Fiddler Using NServiceBus
- GDI图像处理
- DUAL表被“不幸”删除后的恢复
- python用于数学计算的工具介绍:scipy和numpy