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:
5428dae
)
Update tree-divide.md
author
partychicken
<44670668+partychicken@users.noreply.github.com>
Wed, 6 Mar 2019 00:37:31 +0000
(08:37 +0800)
committer
GitHub
<noreply@github.com>
Wed, 6 Mar 2019 00:37:31 +0000
(08:37 +0800)
添加描述
docs/graph/tree-divide.md
patch
|
blob
|
history
diff --git
a/docs/graph/tree-divide.md
b/docs/graph/tree-divide.md
index
9bfa828
..
f8bcd46
100644
(file)
--- a/
docs/graph/tree-divide.md
+++ b/
docs/graph/tree-divide.md
@@
-233,6
+233,8
@@
int main()
![2019-03-06 08-26-43 .png](https://i.loli.net/2019/03/06/5c7f14247591b.png)
+新建出来的点根据题目要求给予恰当的信息即可。例如:统计路径长度时,将原边边权赋为 $1$ ,将新建的边边权赋为 $0$ 即可。
+
分析复杂度,发现最多会增加 $O(n)$ 个点,则总复杂度为 $O(n\log n)$
几乎所有点分治的题边分都能做(常数上有差距,但是不卡),所以就不放例题了。