|
|
вернуться в форумTLE №18 Can you please give me any hint? Try to find algo O(n^(3/2)) or O(n log n ) The best solution is O(n). Try to find it. O(n) ???? Are your sure??? Strange that fastest solution works in 0.125 seconds... O(N) is without using any kind of tree , right ? Can I get a hint to this solution? ( I have already solved the problem .. ) I got a AC, thx. Please, advice me how to solve this problem? Using binary tree? Thank you. I have found this O(N) solution! Just 1 minute thinking. It is really very easy. Thank you very much. If I didnt know that there is such solution I would hardly find it :) From left and from right(Because b>=a). That's the two loops?! poor English... Edited by author 17.10.2006 02:22 |
|
|