I tried to find the proof of the complexity of the Union-Find algorithm (The one that utilizes union by rank and path compression) but I couldn't find it anywhere, so please comment a link or something :D
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
I tried to find the proof of the complexity of the Union-Find algorithm (The one that utilizes union by rank and path compression) but I couldn't find it anywhere, so please comment a link or something :D
Name |
---|
Here, first of it's kind. And here you can try another links, DSU has long history)
DSU complexity? Proof???
Typical red user — can't do anything on his own way.