IOI 2011 Elephants

Правка en1, от mayankp, 2017-12-20 01:26:59

I have heard that the following problem that came on the 2011 IOI had a solution with O(log n) queries rather than O(sqrt(n)) queries by using link-cut trees. What is that solution?

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский mayankp 2017-12-20 01:26:59 254 Initial revision (published)