main.tex

\input{preamble.tex}

\begin{document}
\input{titlepage.tex}
\section{Estructuras de datos}
\subsection{Disjoint Set Union (Union-Find)}
\includecpp{data-structures/disjoint-set-union.cpp}

\subsection{Segment Tree}
\includecpp{data-structures/segment-tree.cpp}

\subsection{Segment Tree Lazy}
\includecpp{data-structures/segment-tree-lazy.cpp}

\subsection{Segment Tree Persistente}
\includecpp{data-structures/segment-tree-persistent.cpp}

\subsection{Segment Tree Iterativo (compacto)}
\includecpp{data-structures/segment-tree-iterative.cpp}

\subsection{Sparse Table}
\includecpp{data-structures/sparse-table.cpp}

\subsection{Li Chao Tree (dynamic, persistent)}
\includecpp{data-structures/li-chao-tree.cpp}

\section{Grafos}
\subsection{LCA (Binary Lifting)}
\includecpp{graphs/lca-binary-lifting.cpp}

\subsection{LCA (Sparse Table+ETT)}
\includecpp{graphs/lca-sparse-table.cpp}

\subsection{Heavy Light Decomposition}
\includecpp{graphs/heavy-light-decomposition.cpp}

\subsection{Dinic Max Flow}
\includecpp{graphs/dinic.cpp}

\subsection{Centroid Decomposition}
\includecpp{graphs/centroid-decomposition.cpp}

\section{Matemáticas}
\subsection{Exponenciación binaria}
\includecpp{mathematics/binpow.cpp}

\subsection{Logaritmo discreto}
%
\includecpp{mathematics/discrete-log.cpp}

\subsection{Lema de Burnside}
\includetext{mathematics/burnside-lemma.tex}
\subsection{Fórmula de inversión de Möbius}
\includetext{mathematics/mobius-inversion.tex}

\section{C++}
\subsection{Custom set/map hash}
\includecpp{cpp/safe-hash.cpp}
\subsection{Policy Based Order Statistics Tree}
\includecpp{cpp/pb-order-statistics-tree.cpp}

\end{document}