@@ -4,6 +4,8 @@ all: comprog.pdf
 
 comprog.pdf: comprog.tex
 	$(PDFLATEX) comprog
+	$(PDFLATEX) comprog
+	rm *.{aux,log,toc}
 
 clean:
-	rm comprog.pdf
+	rm comprog.pdf
@@ -81,6 +81,9 @@ \subsection{Union-Find}
 
         % TODO: \subsection{Segment Tree}
 
+\subsection{Segment Tree}
+\lstinputlisting{code/data-structures/segment_tree.cpp}
+
 \subsection{Fenwick Tree}
 A Fenwick Tree is a data structure that represents an array of $n$ numbers. It supports adjusting the $i$-th element in $O(\log n)$ time, and computing the sum of numbers in the range $i..j$ in $O(\log n)$ time. It only needs $O(n)$ space.
 \lstinputlisting{code/data-structures/fenwick_tree.cpp}