Mo's Algorithm on trees
Difference between en1 and en2, changed 80 character(s)
I was trying to dodid 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 n*sqrt(n) exists? 

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English virus_1010 2017-02-10 22:41:22 80
en1 English virus_1010 2017-02-10 22:06:47 227 Initial revision (published)