No editorials for problem GERALD2 and MONOPLOY?

challenge
editorial
november

#1

Editorials for problems GERALD2 and MONOPLOY are not published. When will they be published??
Waiting eagerly for editorials of these two problems… :slight_smile:


#2

@admin said that they will be published in some time. I guess they are just making some changes based on different approaches used by people during the contest to try to make the editorials as good as possible.


#3

in the meantime, you can look up heavy-light decomposition (hld) for tree graphs, binary indexed trees (bit), and range minimum/maximum queries (rmq).
i have used hld+bit for monoploy, hld+rmq for gerald2.
i’m sure they will publish the editorials soon.


#4

How about posting their original editorial and letting users have a 100 post long argument underneath :slight_smile:


#5

An answer from the admins: here.


#6

@bela_mervado Could you please refer me to some good resources on hld and neat implementation of the same. I read a few , however I’m still not able to grasp the concept.


#7

@bela_mervado yes any good resources for HLD will be greatly appreciated.


#8

guys, check out these for info on hld:

http://wcipeg.com/wiki/Heavy-light_decomposition

http://ipsc.ksp.sk/2009/real/solutions/l.html


#9

@bela_mervado Thanks a lot !