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 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 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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