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 | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 156 |
7 | djm03178 | 152 |
7 | adamant | 152 |
9 | luogu_official | 150 |
10 | awoo | 147 |
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