Is there any good tutorials on persistent data structures? I've seen many solutions for this problem, some uses bitwise trick and some used graphs and dfs which i don't really get how can it be applird to such a problem.
Thanks
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 156 |
7 | adamant | 151 |
7 | djm03178 | 151 |
9 | luogu_official | 150 |
10 | awoo | 146 |
Persistent Data Structures
Is there any good tutorials on persistent data structures? I've seen many solutions for this problem, some uses bitwise trick and some used graphs and dfs which i don't really get how can it be applird to such a problem.
Thanks
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en3 |
![]() |
WalidMasri | 2016-08-22 19:47:53 | 61 | ||
en2 |
![]() |
WalidMasri | 2016-08-22 10:28:02 | 2 | Tiny change: 't be applird to such ' -> 't be applied to such ' | |
en1 |
![]() |
WalidMasri | 2016-08-22 00:33:43 | 306 | Initial revision (published) |
Name |
---|