|
|
вернуться в форумMine is O(m*logn*logn)and got AC in 0.75s,958 KB.
I used a BST,a Hash table and Binary Search.
I think my algorithm is not good enough and I'm interested in how you solve this.
EM:tczw@sina.com Mine is O(mlogm) and got AC in 0.109s, 474kb
I used balance binary search tree. What is your mlogm algorithm? How did you use it ? O(mlogn), lazy segment tree, 0.078.
Edited by author 16.03.2014 14:27 Mine is simple tree O(mlog(m)) and accepted time is 0.015 Mine is (mlogn), implicit segment tree |
|
|
