Mo's Algorithm on trees

Правка en1, от virus_1010, 2017-02-10 22:06:47

I was trying to do the problem COT2(http://www.spoj.com/problems/COT2/) which is solvable using Mo's Algorithm on trees in less than n*sqrt(n) but couldn't.... Wondering if a solution faster than exists?

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский virus_1010 2017-02-10 22:41:22 80
en1 Английский virus_1010 2017-02-10 22:06:47 227 Initial revision (published)