Sep 23, 2022 1 min read 中文 oi_note 主定理 CSP初赛复习 views | comments 主定理# 将一个规模为 nnn 的问题,分治为 aaa 个 ⌊nb⌋\lfloor\dfrac{n}{b}\rfloor⌊bn⌋ 的子问题,每次带来的额外计算为 O(nd)\mathcal{O}(n^d)O(nd),可得到以下关系式: T(n)=aT(⌈nb⌉)+O(nd)T(n)=aT(\lceil\dfrac{n}{b}\rceil)+\mathcal{O}(n^d)T(n)=aT(⌈bn⌉)+O(nd) (for constants a>0,b>1,d≥0),then:(\text{for\,constants\,}a>0,b>1,d\ge0),\text{then}:(forconstantsa>0,b>1,d≥0),then: T(n)={O(nd),d>logbaO(ndlogn),d=logbaO(nlogba),d<logbaT(n) = \begin{cases} \mathcal{O}{(n^d)}, & \quad d>\operatorname{log}_ba\\ \mathcal{O}{(n^d\operatorname{log}n)}, & \quad d=\operatorname{log}_ba\\ \mathcal{O}{(n^{\operatorname{log}_ba})}, & \quad d<\operatorname{log}_ba\\ \end{cases}T(n)=⎩⎨⎧O(nd),O(ndlogn),O(nlogba),d>logbad=logbad<logba