最小生成树
文章平均质量分 85
Hold_My_Own
When the dust settles, and it will, we'll see.
展开
-
(HDU - 2682)Tree
(HDU - 2682)TreeThere are N (2<=N<=600) cities,each has a value of happiness,we consider two cities A and B whose value of happiness are VA and VB,if VA is a prime number,or VB is a prime number or (VA+VB) is a原创 2017-08-24 16:54:58 · 260 阅读 · 0 评论 -
(POJ - 2031)Building a Space Station
(POJ - 2031)Building a Space Station You are a member of the space station engineering team, and are assigned a task in the construction process of the station. You are expected to write a computer program to c原创 2017-08-24 17:27:23 · 287 阅读 · 0 评论 -
(HDU - 4786)Fibonacci Tree
(HDU - 4786)Fibonacci TreeThe first line of the input contains an integer T, the number of test cases. For each test case, the first line contains two integers N(1 <= N <= 105) and M(0 <= M <= 105). Then M原创 2017-08-25 08:55:19 · 296 阅读 · 0 评论 -
(POJ - 2349)Arctic Network
(POJ - 2349)Arctic Network The Department of National Defence (DND) wishes to connect several northern outposts by a wireless network. Two different communication technologies are to be used in establishing the原创 2017-08-25 11:01:19 · 236 阅读 · 0 评论 -
(HDU - 2122)Ice_cream’s world III
(HDU - 2122)Ice_cream’s world III ice_cream’s world becomes stronger and stronger; every road is built as undirected. The queen enjoys traveling around her world; the queen’s requirement is like II problem, bea原创 2017-08-24 14:16:44 · 199 阅读 · 0 评论 -
(POJ - 2485)Highways
(POJ - 2485)Highways The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Flatopian government is aware of this problem.原创 2017-08-24 14:43:23 · 342 阅读 · 0 评论 -
(HDU - 1301)Jungle Roads
(HDU - 1301)Jungle Roads 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 overtakes roads r原创 2017-08-24 15:14:36 · 280 阅读 · 0 评论 -
(POJ - 3522)Slim Span
(POJ - 3522)Slim Span Given an undirected weighted graph G, you should find one of spanning trees specified as follows. The graph G is an ordered pair (V, E), where V is a set of vertices {v1, v2, …, vn} and E原创 2017-08-24 16:09:31 · 267 阅读 · 0 评论