About

Supports minimum and maximum queries (but not both, although one could make two RMQ's) in log(n) time. The build time is O(n). It should be noted that there is a way to achieve O(1) time using a data structure similar to segment trees...

Stars

Watchers

Forks