莫队算法简介
Mo's algorithm is an algorithm proposed by Mo Tao . Before him, the Mo's algorithm has been used in a small group on Codeforces, but Mo was the first person to ever summarize the algorithm in detail. When Mo proposed that algorithm, he only analyzed the ordinary version, but after the countless contributions from many OIers and ACMers, Mo's algorithm now has a variety of expanded versions.
The Mo's algorithm can solve a series of offline interval query problems and its applications are extremely wide. At the same time, it can be easily expanded to handle queries on tree paths and support modification operations.
build本页面最近更新：，更新历史
edit发现错误？想一起完善？ 在 GitHub 上编辑此页！
people本页面贡献者：StudyingFather, Backl1ght, countercurrent-time, Ir1d, greyqz, MicDZ, ouuan
copyright本页面的全部内容在 CC BY-SA 4.0 和 SATA 协议之条款下提供，附加条款亦可能应用