you're free to think a solution exists... =.=

then there's obviously no solution faster than logn

for example:
you want to apply update "L R x" — add x on segment [L;R]
then just add event1 (time = L, change = +x), and event2 (time = R + 1, change = -x)
then just go from 1 to n and apply your events to calculate current element...

yes, method of events...

i think it is impossible

so complicated..

probably you should learn convex hull better, then the solution will be obvious for u

It was an unlucky contest for dreamoon

Accept that you're doing that for contribution, ok?

use smth like pasteubuntu to share your code

you and illi are so annoying! and you're first by contribution only because of your useless stats

I don't think so

DmitriyH and you are so annoying!

think it up yourself

LOL! I did.

Solve every problem you meet.
It works.