最小生成树
键盘崩坏
这个作者很懒,什么都没留下…
展开
-
hdu3371: Connect the Cities
Problem Description In 2100, since the sea level rise, most of the cities disappear. Though some survived cities are still connected with others, but most of them become disconnected. The government原创 2014-08-04 10:51:02 · 294 阅读 · 0 评论 -
hdu1102:Constructing Roads(prime)
Problem Description There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connec原创 2014-08-04 16:10:32 · 317 阅读 · 0 评论 -
HDU1162:Eddy's picture
#include #include #include #define inf 9999999 struct node { double x,y; }p[110]; int vis[110]; double di[110],map[110][110]; double len(node a,node b) { return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(原创 2014-08-04 17:05:06 · 310 阅读 · 0 评论 -
HDU1863:畅通工程(kruskal)
Problem Description 省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可)。经过调查评估,得到的统计表中列出了有可能建设公路的若干条道路的成本。现请你编写程序,计算出全省畅通需要的最低成本。 Input 测试输入包含若干测试用例。每个测试用例的第1行给出评估的道路条数 N、村庄数目M ( 行原创 2014-08-04 15:18:01 · 554 阅读 · 0 评论 -
HDU1233:还是畅通工程
Problem Description 某省调查乡村交通状况,得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可),并要求铺设的公路总长度为最小。请计算最小的公路总长度。 Input 测试输入包含若干测试用例。每个测试用例的第1行给出村庄数目N ( 当N为0时,输入结束原创 2014-08-04 20:28:10 · 338 阅读 · 0 评论 -
HDU1301:Jungle Roads(prime)
Problem Description The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some years ago. But the jungle overt原创 2014-08-04 21:36:17 · 331 阅读 · 0 评论