m-chrzan.xyz
aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMarcin Chrzanowski <mc370754@students.mimuw.edu.pl>2021-11-26 17:04:10 +0100
committerMarcin Chrzanowski <mc370754@students.mimuw.edu.pl>2021-11-26 17:04:10 +0100
commit47b8eb6089bc3f4216ab3ad172f4f76b51e64998 (patch)
tree1f2bcf53370aa68784e5f194d9cadcc97c13b2f9
parent8473425e09f546fd9b3cbbed412665bd3a10b866 (diff)
Reword
-rw-r--r--mgr.tex6
1 files changed, 3 insertions, 3 deletions
diff --git a/mgr.tex b/mgr.tex
index b5bd246..195e6ba 100644
--- a/mgr.tex
+++ b/mgr.tex
@@ -725,9 +725,9 @@ many parts, then, in a bottom-up fashion, compute the state in the root of each
part in the relabeled tree. The computation for each part will take constant
time.
-Partitioning into $O(m)$ parts will take time $O(m \log m)$, then after the
-bottom-up computation we will arrive at the root's state in time $O(m)$, thus
-answering the question in the promised time.
+Partitioning into the $O(m)$ parts we're interested in will take time $O(m \log
+m)$, then after the bottom-up computation we will arrive at the root's state in
+time $O(m)$, thus answering the question in the promised time.
\subsection{LCA partition}