<a href="http://hackage.haskell.org/cgi-bin/hackage-scripts/package/rangemin">http://hackage.haskell.org/cgi-bin/hackage-scripts/package/rangemin</a> efficiently (in effectively linear lazy preprocessing time) processes an array to find minimum elements of subranges of the array in constant time.<br clear="all">
<br>-- <br>Louis Wasserman<br><a href="mailto:wasserman.louis@gmail.com">wasserman.louis@gmail.com</a><br>