Editorial for DMOPC '15 Contest 2 P5 - Sysadmin


Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.

Authors: Xyene, WallE256

The intended solution is the Convex Hull Trick. Implementation is left as an exercise.

Time Complexity: \mathcal{O}((N+Q) \log N)


Comments

There are no comments at the moment.