| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Faced a challenge dealing with "persistent tries",as told by gkcs.Does anybody here have a good tutorial link regarding that.
PROBLEM LINK: https://www.codechef.com/MAY17/problems/GPD
Please stop downvoting the posts without even reading it,in order to maintain a healthy platform to learn(even for newbies) :)
Here is good tutorial for old problem from codechef long challenge
I think to implement and understand persistent trie it is enough to have good knowledge on trie and persistent data structure. I remember it was my first problem to solve with persistent data structure. Before that I just had the idea but didn't implement. In case if you don't have idea on persistent data structure then there is an outstanding blog by anudeep nekkanti. And also you can learn from Geeks for geeks. Hope it helps
https://www.isical.ac.in/~dfslab/2019/lectures/2019-day21-tries.pdf
upvote for equality