Comments

How to prove in D editorial that number of such segments isn't more than log(log n)?