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?
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | virus_1010 | 2017-02-10 22:41:22 | 80 | |||
en1 | virus_1010 | 2017-02-10 22:06:47 | 227 | Initial revision (published) |