Help for an <O(n), O(1)> solution for range minimum query

Правка en2, от one0one, 2017-06-28 17:06:37

Currently, I am researching about range minimum query. I read the topcoder article. At the end of the article there is an <O(n), O(1)> solution for the restricted RMQ.

I didn't understand the article and I have googled it but what I have found was too complex for me. I am a newbie so I need some simple explanations or sources.

Теги rmq, data-structures

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский one0one 2017-06-28 17:10:23 126
en2 Английский one0one 2017-06-28 17:06:37 12
en1 Английский one0one 2017-06-28 15:37:43 376 Initial revision (published)