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

Small fixes

Browse source
This commit is contained in:
Antti H S Laaksonen 2017-02-20 23:23:10 +02:00
parent d4ea994907
commit 797035fd8a
13 changed files with 43 additions and 43 deletions
Download patch file Download diff file Expand all files Collapse all files

8
luku28.tex
View file

@ -199,7 +199,7 @@ Both operations can be implemented using
similar ideas, and it is even possible to construct
a tree that supports both operations at the same time.
\subsubsection{Lazy segment tree}
\subsubsection{Lazy segment trees}
Let us consider an example where our goal is to
construct a segment tree that supports
@ -506,7 +506,7 @@ In this problem, it is easy to combine lazy updates,
because the combination of updates $z_1$ and $z_2$
corresponds to an update $z_1+z_2$.
\subsubsection{Polynomial update}
\subsubsection{Polynomial updates}
Lazy updates can be generalized so that it is
possible to update ranges using polynomials of the form
@ -584,7 +584,7 @@ node *u = new node(0, 0, 15);
u->s = 5;
\end{lstlisting}
\subsubsection{Sparse segment tree}
\subsubsection{Sparse segment trees}
\index{sparse segment tree}
@ -645,7 +645,7 @@ index compression (Chapter 9.4).
However, this is not possible if the indices
are generated during the algorithm.
\subsubsection{Persistent segment tree}
\subsubsection{Persistent segment trees}
\index{persistent segment tree}