If there are people who did not advanced yet then welcome — it will be your last chance to advance to round 2
Place and time.
It is only 6 hours left till the start!

I'm trying to solve a problem http://www.e-olimp.com.ua/ru/problems/4483. I'm building a segment tree: every node of tree stores 2 minimal elements of particular segment. Code: http://ideone.com/Kjk0BQ. But it fails with memory limit, most likely because of line 110. Is it possible to optimize every time array creation?