![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
图论
文章平均质量分 84
joafelnglfds
这个作者很懒,什么都没留下…
展开
-
poj 1797 Heavy Transportation
Heavy Transportation Time Limit: 3000MS Memory Limit: 30000K Total Submissions: 19984 Accepted: 5315 Description Background Hugo Heavy is happy. After the breakdown o原创 2014-07-21 08:32:11 · 698 阅读 · 0 评论 -
poj 2570 Fiber Network Floyd
Description Several startup companies have decided to build a better Internet, called the "FiberNet". They have already installed many nodes that act as routers all around the world. Unfortunately, t原创 2014-08-17 16:10:57 · 643 阅读 · 0 评论 -
poj 3522 Slim Span
Description 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}原创 2014-08-15 08:24:16 · 703 阅读 · 0 评论 -
hdu 1385 Minimum Transport Cost(最短路+字典序+打印路径)
Description These are N cities in Spring country. Between each pair of cities there may be one transportation track or none. Now there is some cargo that should be delivered from one city to anothe原创 2014-08-10 20:20:33 · 789 阅读 · 0 评论 -
poj 3026 Borg Maze bfs+prim
Description The Borg is an immensely powerful race of enhanced humanoids from the delta quadrant of the galaxy. The Borg collective is the term used to describe the group consciousness of the Borg ci原创 2014-08-06 14:40:30 · 741 阅读 · 0 评论 -
zoj 1655 Transport Goods Dijkstra
Description The HERO country is attacked by other country. The intruder is attacking the capital so other cities must send supports to the capital. There are some roads between the cities and the goo原创 2014-08-06 18:58:06 · 864 阅读 · 0 评论 -
poj 2349 Arctic Network 最小生成树
Description 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 net原创 2014-08-04 19:26:57 · 517 阅读 · 0 评论 -
zoj 1586 QS Network 最小生成树
Description Sunny Cup 2003 - Preliminary Round April 20th, 12:00 - 17:00 Problem E: QS Network In the planet w-503 of galaxy cgb, there is a kind of intelligent creature named QS. QScommunicat原创 2014-08-04 14:34:39 · 591 阅读 · 0 评论 -
poj 2421 Constructing Roads 并查集+最小生成树
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 connected, if原创 2014-08-04 09:35:48 · 951 阅读 · 0 评论 -
poj 2031 Building a Space Station 最小生成树
Description 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 complete the原创 2014-08-04 08:44:20 · 613 阅读 · 0 评论 -
poj 2585 Window Pains 拓扑排序
Description Boudreaux likes to multitask, especially when it comes to using his computer. Never satisfied with just running one application at a time, he usually runs nine applications, each in its原创 2014-08-03 19:40:19 · 769 阅读 · 0 评论 -
zoj 3080 ChiBi
Description watashi's mm is so pretty as well as smart. Recently, she has watched the movie Chibi. So she knows more about the War of ChiBi. In the war, Cao Cao had 800,000 soldiers, much more than原创 2014-07-10 15:53:38 · 712 阅读 · 0 评论 -
poj 3255 Roadblocks Dijkstra求次短路
Roadblocks Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 7067 Accepted: 2626 Description Bessie has moved to a small farm and sometimes enjoys returning原创 2014-07-22 10:03:08 · 823 阅读 · 0 评论 -
zoj 2027 Travelling Fee
Description Samball is going to travel in the coming vacation. Now it's time to make a plan. After choosing the destination city, the next step is to determine the travel route. As this poor guy has原创 2014-08-18 10:10:55 · 864 阅读 · 0 评论