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
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 163 |
2 | cry | 161 |
3 | maomao90 | 160 |
4 | -is-this-fft- | 159 |
5 | awoo | 158 |
6 | atcoder_official | 157 |
7 | adamant | 155 |
8 | nor | 154 |
9 | maroonrk | 152 |
10 | Dominater069 | 148 |
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
Name |
---|
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