| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
Hello! These days I was learning RMQ. So now i need some problems on which I can keep training. Can you suggest me some Dynamic RMQ problems. It isn't problem if the suggestions are not from Codeforces. And if it isn't too much, can you post some problems with Hashing, please. Thanks and have a nice day ;)
P.S. Sorry if there was already some topics like this ( I didn't find them)
http://acm.timus.ru/problem.aspx?space=1&num=1989
I know the hashing solution for this problem but I was always wondering if there exist other solutions for this kind of problems where you have some dynamic queries that involve replace, delete or insert and other queries that ask for equality between two substrings or even LCP?
This is a bit hard problem that involves hashing and dynamic data structures that allow range queries. (order statistics tree for example)
http://www.spoj.com/problems/STRLCP/
http://mindcoding.ro/ct/mc2014r4/pb/palarb ( there is a story at beginning , skip it ) http://www.infoarena.ro/problema/hashuri ( at ending there are some links , but unfortuantely all are in Romanian — hope Google Translate makes a good job )