Hi guys, Could anyone give me a good list of problems on palindromic Tree and treaps specially implicit treaps and reverse intervals and dp optimization tricks because I can't find good problems on those topics .. Thanks in advance.
№ | Пользователь | Рейтинг |
---|---|---|
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 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Hi guys, Could anyone give me a good list of problems on palindromic Tree and treaps specially implicit treaps and reverse intervals and dp optimization tricks because I can't find good problems on those topics .. Thanks in advance.
Название |
---|
Google please.
For palindromic tree — problems 2057-2061 from timus.
Solutions of all those problems are in Michail Rubinchik's paper (http://arxiv.org/abs/1506.04862v2)
thanks so much BekzhanKassenov they are great problems ... could you please help me with problems on the other 2 topics
You mentioned treaps and DP optimisation, here's a problem that needs both: Misha and Gym. Though not convex hull trick, it needs a neat knapsack optimisation. TL is slightly strict, use fast I/O.
Here's another treaps problem: Maintaining a sequence. You should see this blog for more.