|
|
back to boardAC AC this problem is very simple! Try to solve the problem with O(n). Re: AC Posted by pnt 29 Jul 2009 16:59 Try to solve it in O(log n) //disregarding the input, of course ;) Re: AC Posted by kobra 10 Aug 2010 17:42 the fastest algorithm is O(N+Q). Faster is impossible! Building RMQ doesn't have a sense, because you don't using the operation update. |
|
|