最小生成树
涅槃phy
这个作者很懒,什么都没留下…
展开
-
POJ 1861 Network
Description(Special Judge) Andrew is working as systemadministrator and is planning to establish a new network in his company. Therewill be N hubs in the company, they can be connected to each other原创 2013-04-16 13:18:54 · 725 阅读 · 0 评论 -
HDU 1102 Constructing Roads
Problem Description There are N villages, whichare numbered from 1 to N, and you should build some roads such that every twovillages can connect to each other. We say two village A and B are connecte原创 2013-05-31 16:12:43 · 769 阅读 · 0 评论 -
HDU 1233 还是畅通工程
Problem Description 某省调查乡村交通状况,得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可),并要求铺设的公路总长度为最小。请计算最小的公路总长度。 Input 测试输入包含若干测试用例。每个测试用例的第1行给出村庄数目N ( 当N为0时,输入结束,该用原创 2013-05-31 16:25:55 · 751 阅读 · 0 评论 -
HDU 1162 Eddy's picture
Problem Description Eddy begins to like paintingpictures recently ,he is sure of himself to become a painter.Every day Eddydraws pictures in his small room, and he usually puts out his newest picture原创 2013-05-31 16:17:51 · 763 阅读 · 0 评论 -
HDU 1301 Jungle Roads
Problem Description The Head Elder of the tropical island of Lagrishan has a problem. A burst offoreign aid money was spent on extra roads between villages some years ago. Butthe jungle overtakes原创 2013-05-31 16:37:26 · 683 阅读 · 0 评论 -
POJ 2560 Freckles
Description In an episode of the Dick VanDyke show, little Richie connects the freckles on his Dad's back to form apicture of the Liberty Bell. Alas, one of the freckles turns out to be a scar,so his原创 2013-08-31 13:45:11 · 693 阅读 · 0 评论