![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
图论
__Simon_
此博客已转移到https://www.cnblogs.com/--Simon/
展开
-
Codeforces Round #527 (Div. 3)-F. Tree with Maximum Cost-树上换根
codeforce-1092-F. Tree with Maximum Cost-树上换根【Description】You are given a tree consisting exactly of n vertices. Tree is a connected undirectedgraph with n−1 edges. Each vertex v of this tree has a...原创 2019-01-17 14:39:36 · 219 阅读 · 0 评论 -
Codeforces Round #527 (Div. 3)-E. Minimal Diameter Forest-树的直径与合并
codeforce-1092-E. Minimal Diameter Forest-树的直径与合并【Description】You are given a forest — an undirected graph with n vertices such that each its connected component is a tree.The diameter (aka "long...原创 2019-01-18 18:14:07 · 431 阅读 · 0 评论 -
Codeforces Round #514 (Div. 2)-E. Split the Tree-树上倍增
Codeforce-1059-E. Split the Tree-树上倍增【Description】You are given a rooted tree on n vertices, its root is the vertex number 1. The i-th vertex contains a number wi. Split it into the minimum possibl...原创 2019-01-16 13:58:40 · 264 阅读 · 0 评论 -
Codeforces Round #532 (Div. 2)-E. Andrew and Taxi-二分+拓扑排序
Codeforces Round #532 (Div. 2)-E. Andrew and Taxi-二分+拓扑排序【Description】Andrew prefers taxi to other means of transport, but recently most taxi drivers have been acting inappropriately. In order to e...原创 2019-02-27 20:05:39 · 299 阅读 · 0 评论 -
Codeforces Round #544 (Div. 3)-F2. Spanning Tree with One Fixed Degree-求无向图中满足1号节点的度为d的生成树
Codeforces Round #544 (Div. 3)-F2. Spanning Tree with One Fixed Degree-求无向图中满足1号节点的度为d的生成树【Description】You are given an undirected unweighted connected graph consisting of n vertices and m edges. I...原创 2019-04-01 17:59:19 · 159 阅读 · 0 评论 -
图论-最短路个人总结
图论-最短路个人总结差分约束如若一个系统由n个变量和m个不等式组成,并且这m个不等式对应的系数矩阵中每一行有且仅有一个1和-1,其它的都为0,这样的系统称为差分约束( difference constraints )系统对于形如:B−A<=c⋯(1)C−B<=a⋯(2)C−A<=b⋯(3)对于形如:\\B-A<=c\cdots (1...原创 2019-04-08 22:09:56 · 252 阅读 · 0 评论