Introduction to Mo's Algorithm

The Mo's algorithm was proposed by Mo Tao. Before Mo Tao proposed the algorithm, it had been circulating in a small circle among top competitors on Codeforces. However, Mo Tao was the first to provide a detailed summary and systematization of the algorithm. When Mo Tao introduced the algorithm, he only analyzed the basic version, but through the collective wisdom of OIers and ACMers, Mo's algorithm has been extended into multiple variants.

Mo's algorithm can solve a class of offline interval query problems with extremely wide applicability. By extending it, it can also easily handle path queries on trees and support modification operations.

---

本页面最近更新：，更新历史
发现错误？想一起完善？ 在 GitHub 上编辑此页！
本页面贡献者：OI-wiki
本页面的全部内容在 CC BY-SA 4.0 和 SATA 协议之条款下提供，附加条款亦可能应用