bibin
/
cphb
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Mention the name 'sparse table' [closes #29]

This commit is contained in:
Antti H S Laaksonen 2017-04-17 10:53:02 +03:00
parent 8c564bd46b
commit e5c50e115e
1 changed files with 6 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
chapter09.tex
View File

@ -244,10 +244,12 @@ to the position of $X$.
Next we will see how we can Next we will see how we can
process range minimum queries in $O(1)$ time process range minimum queries in $O(1)$ time
after an $O(n \log n)$ time preprocessing\footnote{There are also after an $O(n \log n)$ time preprocessing using \index{sparse table}
sophisticated techniques \cite{fis06} where the preprocessing time a data structure called a \emph{sparse table}\footnote{The
is only $O(n)$, but such algorithms are not needed in sparse table structure was introduced in \cite{ben00}.
competitive programming.}. There are also more sophisticated techniques \cite{fis06} where
the preprocessing time of the array is only $O(n)$, but such algorithms
are not needed in competitive programming.}.
Note that minimum and maximum queries can always Note that minimum and maximum queries can always
be processed using similar techniques, be processed using similar techniques,
so it suffices to focus on minimum queries. so it suffices to focus on minimum queries.