Nastya and King Shamans

Правка en2, от Doritos4, 2018-07-17 21:11:20

In the editorial for problem E, how does the author descend down the segment tree to find the leftmost maximum element? It hasn’t been explained there.

Edit: I’ve understood how to go down the tree, but I’m unable to convince myself that its complexity is O(logn) per query. Please help.


  Rev. Язык Кто Когда Δ Комментарий
en2 Английский Doritos4 2018-07-17 21:11:20 128
en1 Английский Doritos4 2018-07-09 18:27:56 221 Initial revision (published)