I was going through this tutorial http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=lowestCommonAncestor but i was not able to fully understand the <O(N), O(1)> algorithm for the restricted RMQ. They have converted the array into a new binary array and find a solution for this new array. But how they are getting the solution for the original array?
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/4Za8aJYhwEUJ. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
