信息学奥赛知识结构图.docxVIP

— PAGE \* Arabic 1 — 信息学奥赛知识结构图 SASLP  ├─01.基础(base)  │├─01.高精度(bignum)  │├─02.排序(sort)  ││├─01.选择排序(select sort)  ││├─02.冒泡排序(bubble sort)  ││├─03.希尔排序(shell sort)  ││├─04.快速排序(quick sort)  ││├─05.归并排序(merge sort)  ││├─06.堆排序(heap sort)  ││└─07.桶排序(bucket sort)  │├─03.分治法(dichotomy)  │├─04.动态规划(dynamic programming)  ││├─01.单调队列(humdrum queue)  ││├─02.四边形不等式()  ││└─03.决策单调性()  │├─05.贪心(greedy)  │└─06.搜索(search)  │├─01.深度优先搜索(depth first search)  │├─02.宽度优先搜索(breadth first search)  │└─03.迭代加深搜索(iterative deepening)  ├─02.数学(maths)  │├─01.高斯消元(gauss elimination)  │├─02.同余(modular arithmetic)  │├─03.进位制()  │├─04.开方(evolution)  │└─x.01.群论(group theory)  ├─03.数据结构(data structure)  │├─01.线性表(linear table)  ││├─01.栈(stack)  ││├─02.队列(queue)  ││├─03.哈希表(hash array)  ││└─04.链表(linked list)  │├─02.优先队列(priority queue)  ││├─01.堆(heap)  ││└─02.单调队列(humdrum queue)  │├─03.线段树(interval tree)  │├─04.树状数组(tree array)  │├─05.二叉查找树平衡树(binary search tree balanced search tree) ││├─01.二叉查找树(binary search tree)  ││├─02.伸展树(splay)  ││├─03.Treap(treap)  ││├─04.SBT(size balanced tree)  ││└─05.AVL()  │└─06.并查集(union-find sets)  ├─04.图论(graph theory)  │├─01.最短路(short-path problem)  ││├─01.单源最短路()  │││├─01.Dijkstra(Dijkstra)  │││├─02.Bellman-Ford(Bellman-Ford-Moore)  │││└─03.SPFA(Shortest Path Faster Algorithm)  ││└─02.多源最短路()  ││└─01.Floyd(Floyd)  │├─02.最小生成树()  ││├─01.Prim(Prim)  ││└─02.Kruskal(Kruskal)  │├─03.网络流(network flow)  ││├─01.最大流(maxflow)  │││├─01.Dinic(Dinic)  │││├─02.最小切割最大流定理()  │││└─x.01.HLPP(highest labeled preflow-push)  ││├─02.上下界网络流()  │││├─01.无源无汇上下界网络可行流()  │││└─02.上下界网络最小及最大流  ││└─03.最小费用流()  ││└─01.最短路费用流  │└─04.二分图(bipartite graph)  │├─01.二分图最大匹配()  │├─02.带权二分图最优匹配()  │├─03.有向图最小覆盖()  │├─04.