随笔分类 -  树(杂谈)

上一页 1 2
HDU 3371 kruscal/prim求最小生成树 Connect the Cities 大坑大坑
摘要：这个时间短 700多s #include<stdio.h> #include<string.h> #include<iostream> #include<algorithm> using namespace std; struct node{ int u; int v; int w; }que[10 阅读全文
posted @ 2015-07-11 21:15 柳下_MBX 阅读(752) 评论(0) 推荐(0)
HDU1879 kruscal 继续畅通工程
摘要：继续畅通工程 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17028 Accepted Submission(s): 7319 Problem 阅读全文
posted @ 2015-07-11 12:58 柳下_MBX 阅读(409) 评论(0) 推荐(0)
poj 3026 bfs+prim Borg Maze
摘要：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 t 阅读全文
posted @ 2015-07-08 21:11 柳下_MBX 阅读(223) 评论(0) 推荐(0)
poj1258 Agri-Net 最小生成树
摘要：Agri-Net Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 44032 Accepted: 18001 Description Farmer John has been elected mayor of his town! 阅读全文
posted @ 2015-07-08 13:52 柳下_MBX 阅读(140) 评论(0) 推荐(0)
poj2485 Highways 最小生成树
摘要：Description The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. 阅读全文
posted @ 2015-07-08 13:31 柳下_MBX 阅读(263) 评论(0) 推荐(0)
poj1789 Truck History最小生成树
摘要：Truck History Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 20768 Accepted: 8045 Description Advanced Cargo Movement, Ltd. uses trucks of 阅读全文
posted @ 2015-07-08 12:21 柳下_MBX 阅读(163) 评论(0) 推荐(0)
poj3026（bfs+prim）最小生成树
摘要：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 t 阅读全文
posted @ 2015-06-10 19:30 柳下_MBX 阅读(316) 评论(0) 推荐(0)
HLG2040二叉树遍历已知前中，求后
摘要：二叉树的遍历Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 60(34 users)Total Accepted: 34(30 users)Rating: Special Judge: NoDescription给出一棵二叉树的中序和前序遍... 阅读全文
posted @ 2015-04-15 11:48 柳下_MBX 阅读(231) 评论(0) 推荐(0)
先序，中序，后序，已知两者求第三者
摘要：今天来总结下二叉树前序、中序、后序遍历相互求法，即如果知道两个的遍历，如何求第三种遍历方法，比较笨的方法是画出来二叉树，然后根据各种遍历不同的特性来求，也可以编程求出，下面我们分别说明。首先，我们看看前序、中序、后序遍历的特性：前序遍历： 1.访问根节点 2.前序遍历左子树 3.前序遍历右子树中序遍... 阅读全文
posted @ 2015-04-14 23:46 柳下_MBX 阅读(426) 评论(0) 推荐(0)

上一页 1 2