References

This commit is contained in:
Antti H S Laaksonen 2017-02-21 01:17:36 +02:00
parent 797035fd8a
commit 07816edf67
16 changed files with 237 additions and 40 deletions

View file

@ -314,7 +314,9 @@ because both cases take a total of $O(n \sqrt n)$ time.
\index{Mo's algorithm}
\key{Mo's algorithm} can be used in many problems
\key{Mo's algorithm} \footnote{According to \cite{cod15}, this algorithm
is named after Mo Tao, a Chinese competitive programmer. However,
the technique has been appeared earlier in the literature \cite{ken06}.} can be used in many problems
that require processing range queries in
a \emph{static} array.
Before processing the queries, the algorithm