RMQ : Best Time Complexity

What is the best time complexity one can achieve in finding LCA using RMQ(Static)??

I know RMQ using Sparse Table==>Preprocessing Time: O{NlogN) Query:O(1)

Segment Tree.Preprocessing Time: O{N) Query:O(logN).

Is there method with preprocessing time O(N) and Query : O(1)??

segment-tree rmq sparse-tables

asked 10 Jul '17, 11:40

3★jaypatel3998
41●4
accept rate: 0%

One Answer:

0	here it is:https://www.topcoder.com/community/data-science/data-science-tutorials/range-minimum-query-and-lowest-common-ancestor/#A%20O(N),%20O(1)%20algorithm%20for%20the%20restricted%20RMQ link answered 10 Jul '17, 13:18 4★hruday968 1.7k●2●10 accept rate: 14%

toggle preview

community wiki:

Preview

By Email:

Once you sign in you will be able to subscribe for any updates here

By RSS:

Answers

Answers and Comments

Markdown Basics

*italic* or _italic_
**bold** or __bold__
link:[text](http://url.com/ "title")
image?![alt text](/path/img.jpg "title")
numbered list: 1. Foo 2. Bar
to add a line break simply add two spaces to where you would like the new line to be.
basic HTML tags are also supported
mathemetical formulas in Latex between $ symbol

Question tags:

question asked: 10 Jul '17, 11:40

question was seen: 291 times

last updated: 10 Jul '17, 13:18