树
Haskei
这个作者很懒,什么都没留下…
展开
-
并查集
并查集分两部分,并和查,把相同祖先的人并到一起,查是检查两个人是否是同一个祖先,并查集与邻接表有些相似,但是邻接表是没办法通过直接通过起点和终点确定,两个点之间是否有边,其实也就是表达的并查集当中的两个人是否与共同的祖先#include#include#include#include#include#include#include#define maxn 20#define i原创 2016-11-10 00:27:57 · 322 阅读 · 0 评论 -
POJ 1703 Find them, Catch them 种类并查集
Find them, Catch themTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %lluSubmit Status Practice POJ 1703DescriptionThe police office in Tadu City decides原创 2016-11-22 17:25:20 · 381 阅读 · 0 评论 -
Socks CF 731C 并查集
SocksTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 731CDescriptionArseniy is already grown-up and independent.原创 2016-11-22 21:43:29 · 944 阅读 · 0 评论 -
Slim Span 求生成树的最大边与最小边的差最小的值
Slim SpanTime Limit:5000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice POJ 3522DescriptionGiven an undirected weighted graph G, you should原创 2016-11-21 20:52:49 · 1144 阅读 · 0 评论 -
Borg Maze 广搜+最小生成树
Borg MazeTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionThe Borg is an immensely powerful race of enhanced humanoids from the d原创 2016-11-20 16:20:50 · 429 阅读 · 0 评论 -
Truck History 最小生成树
Truck HistoryTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionAdvanced Cargo Movement, Ltd. uses trucks of different types. Some原创 2016-11-19 16:12:06 · 477 阅读 · 0 评论 -
The Unique MST 独一无二的最小生成树
The Unique MSTTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionGiven a connected undirected graph, tell if its minimum spanning t原创 2016-11-19 15:36:31 · 376 阅读 · 0 评论 -
The Suspects 解决多棵树合并成一棵树的问题
The SuspectsTime Limit:1000MS Memory Limit:20000KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionSevere acute respiratory syndrome (SARS), an atypical pneumonia of u原创 2016-11-18 10:45:01 · 1259 阅读 · 0 评论 -
Conscription 征兵
ConscriptionTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionWindy has a country, and he wants to build an army to protect his原创 2016-11-17 15:54:19 · 458 阅读 · 0 评论 -
Fix a Tree 利用并查集合并树,解决树中存在环的问题
Fix a TreeTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionA tree is an undirected connected graph without cycles.Let's cons原创 2016-11-16 19:58:04 · 527 阅读 · 0 评论 -
Prime算法 与 Kruskal算法的时间复杂度比较
转自G机器猫评测环境:WindowsXP,FreePascal2.40,Pentium(R) Dual-Core CPU T4300@2.10GHz,2G内存通过上图可以看出:1.Prim在稠密图中比Kruskal优,在稀疏图中比Kruskal劣。2.Prim+Heap在任何时候都有令人满意的的时间复杂度,但是代价是空间消转载 2016-11-11 20:23:48 · 17001 阅读 · 1 评论 -
最小生成树
1.Kruskal算法首先按照变得权值从小到大排序,每次从剩余的边中选出权值最小的且两个顶点不在同一集合中的边(为的是不产生回路),加入到生成树中,直到加入了n-1条边为止对边进行快排O(MkogM),在m条边中选出n-1条边是O(MlogN),所以Kruskal算法的时间复杂度为O(MlogM +MlogN),通常M要比N大得多,因此最终算法的时间复杂度为O(MlogM)#inc原创 2016-11-10 20:34:15 · 397 阅读 · 0 评论