Hello,
This is an interesting data structure problem.
It can't be solved with regular insertion and print.
Who do you think it can be solved ??
Hello,
This is an interesting data structure problem.
It can't be solved with regular insertion and print.
Who do you think it can be solved ??
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 155 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 8 | orz | 146 |
| 10 | BledDest | 145 |
Rope will do just fine.
it's very nice, I understood most of what I read, but I couldn't find any more tutorial's,explanations, and implementation for it.
Do you have any ??
look here: https://www.sgi.com/tech/stl/Rope.html, you can use it with some c++ compilers..
Thanks, I wanted to see full implementation but this is enough now :D
is there any other data structures with log(n) time insert delete and range query ??
Treap?
hello Just-yousef
This problem is already asked in lunch time contest on codechef. you can check this link for more details here. You can check the editorial for the detail explanation of the solution to this problem.
Here are the steps to solve this problem. 1. First find the final string after all insertion. ( Think on this ) 2. Now process queries in the reverse order and a simple rank based segment tree will help you to answer each query.
I have written just to guide you. If u find anything that is not understandable from the available editorial just reply on this thread. I will be more happy to help you.
thanks, I've read the tutorial and I understood it, but I need to improve mu knowledge of BIT first.
Thanks :D
Hello JUST_Yousef,
Have you understood the solution of this problem ? This problem was seriously one of the most interesting problem. If you got the solution correctly try this one from the codeforces discussion here