Next ForgeOpenTech
Books
Advanced Guide to Algorithm Competitions

Advanced Guide to Algorithm Competitions

Advanced Guide to Algorithm Competitions

Author: Local Import Script
importedmath
Chapters
83
Estimated time
-

Table of Contents

01_基本算法

0x01_位运算

0x04_二分

0x06_倍增

0x08_总结与练习

0x02_枚举、模拟、递推

0x05_排序

0x07_贪心

README

02_基本数据结构

0x12_队列

0x14_Hash

0x16_Trie

0x11_栈

0x13_链表与邻接表

0x15_字符串

0x18_总结与练习

README

03_搜索

0x23_剪枝

0x25_广度优先搜索

0x27_A星

0x29_总结与练习

0x22_深度优先搜索

0x24_迭代加深

0x26_广搜变形

0x28_IDA星

0x21_树与图的遍历

README

04_数学知识

0x31_质数

0x33_同余

0x32_约数

0x35_高斯消元与线性空间

0x37_容斥原理与Mobius函数

0x39_01分数规划

0x3B_总结与练习

0x36_组合计数

0x38_概率与数学期望

0x3A_博弈论之SG函数

README

05_数据结构进阶

0x41_并查集

0x43_线段树

0x42_树状数组

0x44_分块

0x46_二叉查找树与平衡树初步

0x45_点分治

0x47_总结与练习

README

06_动态规划

0x52_背包

0x54_树形DP

0x57_倍增优化DP

0x5A_斜率优化

0x51_线性DP

0x53_区间DP

0x56_状态压缩DP

0x58_数据结构优化 DP

0x59_单调队列优化DP

0x5C_计数类DP

0x5D_数位统计 DP

0x5B_四边形不等式

0x5E_总结与练习

README

07_图论

0x62_最小生成树

0x64_基环树

0x66_Tarjan算法与无向图连通性

0x68_二分图的匹配

0x6A_网络流初步

0x61_最短路

0x63_树的直径与最近公共祖先

0x65_负环与差分约束

0x67_Tarjan算法与有向图连通性

0x69_二分图的覆盖与独立集

0x6B_总结与练习

README

08_综合技巧与实践

0x72_随机数据生成与对拍

README

09_附录

README

OpenTech

AI-Powered Reading and Learning Platform

Built withLogoNexty.dev

Languages

  • English
  • 中文
  • 日本語

Open Source

  • Next Forge
  • Landing Page Boilerplate
  • Blog Boilerplate

Other Products

  • Nexty - SaaS Template
  • OG Image Generator
  • Dofollow.Tools

Subscribe to our newsletter

Get the latest news and updates from Next Forge

Copyright © 2025 Next Forge All rights reserved.

Privacy PolicyTerms of Service
Featured on Dofollow.Tools