diff options
| -rw-r--r-- | mgr.tex | 6 |
1 files changed, 3 insertions, 3 deletions
@@ -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} |