i was thinking this problem for hours, and i do not get how to solve in time.
the link:
https://icpcarchive.ecs.baylor.edu/index.php?option=onlinejudge&page=show_problem&problem=4330
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3821 |
3 | Benq | 3736 |
4 | Radewoosh | 3631 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3388 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
i was thinking this problem for hours, and i do not get how to solve in time.
the link:
https://icpcarchive.ecs.baylor.edu/index.php?option=onlinejudge&page=show_problem&problem=4330
Название |
---|
I hope this will be useful rope
thanks :D
There is simple offline solution. You have to process queries in backward order. It is hard for me to explain in english. code.
I have just solved this problem just right before I see this post LOL :D
During the contest this problem was solved by only one team :D, nobody knew about the rope implementation built within STL!
Here is my code:
http://ideone.com/jNfg1h