|
|
вернуться в форумПоказать все сообщения Спрятать все сообщенияI use Hash and binary-search and got Ac in 0.828 s. my algo has order O(n^2 * (lg n)^2). but some person can Ac in 0.109 s what this algo? sorry for my poor english. Edited by author 18.02.2011 12:03 You can change map/set into unordered_map/set get faster, reduce time O(lg n) O(∩_∩)O Edited by author 07.09.2016 18:47 |
|
|