生成树
morejarphone
这个作者很懒,什么都没留下…
展开
-
POJ 2031 (最小生成树)
题意是n个球求MST,球相交或者相切距离认为是0.#include #include #include #include #include using namespace std;#define maxn 111struct yuan { double x, y, z, r;}p[maxn];struct node { int u, v; doub原创 2015-11-28 11:38:56 · 382 阅读 · 0 评论 -
UVALive 6837 (最小生成树)
题意是给定一个联通图,求这个图的最小生成树的不可替代边有哪些,并计算这些边的总权值.先求出任意一棵MST,然后标记树边和非树边,然后枚举非树边,对于非树边的两个点u,v,在MST中如果u->v的路径上有边的权值等于这条非树边的权值那么这条树边就是可替代边,给它打上标记.u->v的路径可以通过u->LCA(u,v), v->LCA (u,v)暴力枚举.复杂度(m*n).#include原创 2015-12-07 13:32:02 · 496 阅读 · 0 评论 -
HDU 5627 (生成树)
Clarke and MSTTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 282 Accepted Submission(s): 157Problem DescriptionClarke is a p原创 2016-02-15 21:47:40 · 546 阅读 · 0 评论 -
POJ 2728 (最优比率生成树+二分或者迭代)
Desert KingTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 23100 Accepted: 6478DescriptionDavid the Great has just become the king of a desert country.原创 2016-03-16 18:46:37 · 337 阅读 · 0 评论 -
生成树计数 matrix-tree定理学习笔记
关于生成树计数,有一个叫matrix-tree定理的东西.可以参考《生成树的计数及其应用》.主要就是把原图用一个 Kirchhoff矩阵存下来,这个矩阵是原图的关联矩阵和自身的转置的乘积,简单处理就是对角线表示这个节点的度数,然后矩阵中其他元素如果存在这条边就是-1,否则就是0.然后这个图的生成树个数就是Kirchhoff矩阵任意n-1阶主子式的行列式值.UVA 1原创 2016-05-04 22:38:02 · 603 阅读 · 0 评论 -
URAL 1627 (生成树计数)
1627. JoinTime limit: 4.0 secondMemory limit: 64 MBBusinessman Petya recently bought a new house. This house has one floor with n × m square rooms, placed in rectangular lattice. Some ro原创 2016-05-05 01:00:21 · 682 阅读 · 0 评论 -
HDU 4350 (生成树计数 判断点在线段上)
LightningTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1781 Accepted Submission(s): 607Problem DescriptionThere are N robot原创 2016-05-05 19:52:35 · 370 阅读 · 0 评论 -
SPOJ HIGH (生成树计数)
HIGH - Highwaysno tags In some countries building highways takes a lot of time... Maybe that's because there are many possiblities to construct a network of highways and engineers can't原创 2016-05-05 21:12:06 · 366 阅读 · 0 评论 -
HDU 5723 (最小生成树 树DP)
题目链接:点击这里题意:求一个图的最小生成树, 并且在这个最小生成树的基础上, 求随机取两个点不同的点的路径长度的期望。最小生成树直接可以求出来,然后枚举每一条边对期望的贡献即可。#include <cstdio>#include <cstring>#include <algorithm>#include <iostream>#include <cmath>using namespace原创 2016-07-20 21:57:32 · 393 阅读 · 0 评论