最小生成树
文章平均质量分 85
SIO__Five
这个作者很懒,什么都没留下…
展开
-
POJ 2377 Bad Cowtractors
这是先前做的几道最小生成树的题目,基本都是裸题。 题意:求最大生成树 由于数据比较水,用prime和krusical都可以。我是用krusical做的 #include #include #include #include #include using namespace std; int n,m,f[1010]; struct node { int x,y,s; }e[20010]原创 2013-08-23 13:29:54 · 1017 阅读 · 0 评论 -
POJ 2349 Arctic Network
题意:也是求最小生成树,不过在n个点当中可以有s个点已经相连。 用krusical做。记录每次加的边数,当连通的边数有n-s便跳出。 #include #include #include #include #include using namespace std; int n,s,f[1010]; struct node { int x,y; double s; }e[原创 2013-08-23 13:33:40 · 838 阅读 · 0 评论 -
POJ 3723 Conscription
Conscription Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6325 Accepted: 2184 Description Windy has a country, and he wants to build an army to protect原创 2013-08-23 13:43:55 · 913 阅读 · 0 评论 -
POJ 1287 Networking
Networking Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 5417 Accepted: 2915 Description You are assigned to design network connections between certain p原创 2013-08-14 13:20:26 · 893 阅读 · 0 评论 -
POJ 1251 Jungle Roads
Jungle Roads Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 17586 Accepted: 7937 Description The Head Elder of the tropical island of Lagrishan has a原创 2013-08-14 13:08:53 · 935 阅读 · 0 评论 -
POJ 1861 Network
Network Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 12067 Accepted: 4652 Special Judge Description Andrew is working as system administrator and is原创 2013-08-17 18:01:24 · 904 阅读 · 0 评论 -
POJ 2031 Building a Space Station
Building a Space Station Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 3705 Accepted: 1884 Description You are a member of the space station engineering原创 2013-08-17 18:05:34 · 941 阅读 · 0 评论 -
POJ 1679 The Unique MST (次小生成树)
The Unique MST Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 17785 Accepted: 6176 Description Given a connected undirected graph, tell if its minimum spa原创 2013-08-17 17:57:49 · 1184 阅读 · 2 评论 -
【wikioi 1002】搭桥 dfs+kruskal
题目描述 Description 有一矩形区域的城市中建筑了若干建筑物,如果某两个单元格有一个点相联系,则它们属于同一座建筑物。现在想在这些建筑物之间搭建一些桥梁,其中桥梁只能沿着矩形的方格的边沿搭建,如下图城市1有5栋建筑物,可以搭建4座桥将建筑物联系起来。城市2有两座建筑物,但不能搭建桥梁将它们连接。城市3只有一座建筑物,城市4有3座建筑物,可以搭建一座桥梁联系两栋建筑物,但不能与第三座原创 2014-10-20 22:20:57 · 1018 阅读 · 0 评论