|
|
back to boardIs there a solution can solve the problem faster than a o(m*n^0.5) algorithm) Posted by coma 3 Jun 2003 11:15 Re: Is there a solution can solve the problem faster than a o(m*n^0.5) algorithm) There is an O(n) solution for this problem. Re: Is there a solution can solve the problem faster than a o(m*n^0.5) algorithm) Posted by WinTokk 15 Apr 2004 18:00 Mine is O(M*logM). Edited by author 15.04.2004 18:02 |
|
|