From 47b8eb6089bc3f4216ab3ad172f4f76b51e64998 Mon Sep 17 00:00:00 2001 From: Marcin Chrzanowski Date: Fri, 26 Nov 2021 17:04:10 +0100 Subject: Reword --- mgr.tex | 6 +++--- 1 file 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} -- cgit v1.2.3