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:
363e2da
)
fix format
author
Tianyi Qiu
<gordanqiu@outlook.com>
Thu, 19 Nov 2020 09:51:35 +0000
(17:51 +0800)
committer
Tianyi Qiu
<gordanqiu@outlook.com>
Thu, 19 Nov 2020 09:51:35 +0000
(17:51 +0800)
docs/misc/rand-technique.md
patch
|
blob
|
history
diff --git
a/docs/misc/rand-technique.md
b/docs/misc/rand-technique.md
index
7eb12ee
..
cbe304f
100644
(file)
--- a/
docs/misc/rand-technique.md
+++ b/
docs/misc/rand-technique.md
@@
-137,7
+137,7
@@
author: Ir1d, partychicken, ouuan, Marcythm, TianyiQ
而连续选完 $k$ 对 $(s,t)$ 后判断它们是否全部满足目标 I 很简单,只要再跑一遍强连通缩点,判断一下 $n,m$ 是否都减小了 $k$ 即可。注意到若每次减少 $k=\dfrac{\min(n,m)}2$ ,则 $min(n,m)$ 必在 $O(\log(n+m))$ 轮内变成 1 ,也就转化到了平凡的情况。
???+ note "算法伪代码"
- ```
+ ```
text
while(n>1 and m>1):
randomly choose k=min(n,m)/2 pairs (s,t)
add edge t->s for all these pairs