图论
njupt_wrj
这个作者很懒,什么都没留下…
展开
-
POJ 1789 Truck History (Kruskal最小生成树) 模板题
DescriptionAdvanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable delivery, other for furniture, or for bricks. The company has its own code describing each t...原创 2018-03-25 11:46:46 · 200 阅读 · 0 评论 -
POJ 1751 Highways(最小生成树Prim普里姆,输出边)
题目链接:点击打开链接DescriptionThe island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has a very poor system of public highways. The Flatopian government is aware of this problem and has alre...原创 2018-03-26 23:34:51 · 310 阅读 · 0 评论 -
PTA 7-10 树的遍历(二叉树基础、层序遍历、STL初体验之queue)
7-10 树的遍历(25 分)给定一棵二叉树的后序遍历和中序遍历,请你输出其层序遍历的序列。这里假设键值都是互不相等的正整数。输入格式:输入第一行给出一个正整数N(≤30),是二叉树中结点的个数。第二行给出其后序遍历序列。第三行给出其中序遍历序列。数字间以空格分隔。输出格式:在一行中输出该树的层序遍历的序列。数字间以1个空格分隔,行首尾不得有多余空格。输入样例:7 2 3 1 5 7 6 4 1 ...原创 2018-03-28 12:50:39 · 551 阅读 · 0 评论 -
Codeforces 977D Divide by three, multiply by two(拓扑排序)
Polycarp likes to play with numbers. He takes some integer number xx, writes it down on the board, and then performs with it n−1n−1operations of the two kinds:divide the number xx by 33 (xx must be di...原创 2018-05-12 17:14:12 · 264 阅读 · 0 评论