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

Corrections

This commit is contained in:
Antti H S Laaksonen 2017-02-15 23:45:36 +02:00
parent 8b8a36c261
commit d1dc9063f3
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
luku09.tex
View File

@ -75,8 +75,8 @@ We first focus on a situation where
the array is \key{static}, i.e., the array is \key{static}, i.e.,
the elements are never modified between the queries. the elements are never modified between the queries.
In this case, it suffices to construct In this case, it suffices to construct
a data structure that tells us a static data structure that tells us
the answer for any possible query efficiently. the answer for any possible query.
\subsubsection{Sum queries} \subsubsection{Sum queries}
@ -249,8 +249,8 @@ 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.
Let $\textrm{rmq}(a,b)$ denote the minimum element Let $\textrm{rmq}(a,b)$ (''range minimum query'')
in the range $[a,b]$. denote the minimum element in the range $[a,b]$.
The idea is to precalculate all values of $\textrm{rmq}(a,b)$ The idea is to precalculate all values of $\textrm{rmq}(a,b)$
where $b-a+1$, the length of the range, is a power of two. where $b-a+1$, the length of the range, is a power of two.
For example, for the array For example, for the array