OSDN Git Service
(root)
/
oi-wiki
/
main.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
| inline |
side by side
(parent:
d48c1cb
)
Update tree-divide.md
author
partychicken
<44670668+partychicken@users.noreply.github.com>
Wed, 6 Mar 2019 01:21:04 +0000
(09:21 +0800)
committer
GitHub
<noreply@github.com>
Wed, 6 Mar 2019 01:21:04 +0000
(09:21 +0800)
修改图片路径
docs/graph/tree-divide.md
patch
|
blob
|
history
diff --git
a/docs/graph/tree-divide.md
b/docs/graph/tree-divide.md
index
f8bcd46
..
798b16a
100644
(file)
--- a/
docs/graph/tree-divide.md
+++ b/
docs/graph/tree-divide.md
@@
-219,7
+219,7
@@
int main()
考虑一个菊花图
-![菊花图.png](
https://i.loli.net/2019/03/06/5c7f0ee388e4f
.png)
+![菊花图.png](
./images/tree-divide1
.png)
我们发现当一个点下有多个 $size$ 接近的儿子时,复杂度变得不对起来。
@@
-231,7
+231,7
@@
int main()
显然,我们只需像线段树那样建树就可以了。就像这样
-![2019-03-06 08-26-43 .png](
https://i.loli.net/2019/03/06/5c7f14247591b
.png)
+![2019-03-06 08-26-43 .png](
./images/tree-divide2
.png)
新建出来的点根据题目要求给予恰当的信息即可。例如:统计路径长度时,将原边边权赋为 $1$ ,将新建的边边权赋为 $0$ 即可。