https://codeforces.com/contest/1101/problem/F The following solution is faster than mine. It is based on the fact that the prefix maximum doesn't change at most O(log N) times. https://codeforces.com/blog/entry/64438?#comment-483640There i…