信息学奥赛知识结构图

《信息学奥赛知识结构图》由会员上传分享，免费在线阅读，更多相关内容在应用文档-天天文库。

1、SASLP├─01.基础(base)│├─01.高精度(bignum)│├─02.排序(sort)││├─01.选择排序(selectsort)││├─02.冒泡排序(bubblesort)││├─03.希尔排序(shellsort)││├─04.快速排序(quicksort)││├─05.归并排序(mergesort)││├─06.堆排序(heapsort)││└─07.桶排序(bucketsort)│├─03.分治法(dichotomy)│├─04.动态规划(dynamicprogramming)││├─01.单调队列(humd

2、rumqueue)││├─02.四边形不等式()││└─03.决策单调性()│├─05.贪心(greedy)│└─06.搜索(search)│├─01.深度优先搜索(depthfirstsearch)│├─02.宽度优先搜索(breadthfirstsearch)│└─03.迭代加深搜索(iterativedeepening)├─02.数学(maths)│├─01.高斯消元(gausselimination)│├─02.同余(modulararithmetic)│├─03.进位制()│├─04.开方(evolution)│└─x.0

3、1.群论(grouptheory)├─03.数据结构(datastructure)│├─01.线性表(lineartable)││├─01.栈(stack)││├─02.队列(queue)││├─03.哈希表(hasharray)││└─04.链表(linkedlist)│├─02.优先队列(priorityqueue)││├─01.堆(heap)││└─02.单调队列(humdrumqueue)│├─03.线段树(intervaltree)│├─04.树状数组(treearray)│├─05.二叉查找树&平衡树(binarysea

4、rchtree&balancedsearchtree)││├─01.二叉查找树(binarysearchtree)││├─02.伸展树(splay)││├─03.Treap(treap)││├─04.SBT(sizebalancedtree)││└─05.AVL()│└─06.并查集(union-findsets)├─04.图论(graphtheory)│├─01.最短路(short-pathproblem)││├─01.单源最短路()│││├─01.Dijkstra(Dijkstra)│││├─02.Bellman-Ford(Be

5、llman-Ford-Moore)│││└─03.SPFA(ShortestPathFasterAlgorithm)││└─02.多源最短路()││└─01.Floyd(Floyd)│├─02.最小生成树()││├─01.Prim(Prim)││└─02.Kruskal(Kruskal)│├─03.网络流(networkflow)││├─01.最大流(maxflow)│││├─01.Dinic(Dinic)│││├─02.最小切割最大流定理()│││└─x.01.HLPP(highestlabeledpreflow-push)││├

6、─02.上下界网络流()│││├─01.无源无汇上下界网络可行流()│││└─02.上下界网络最小及最大流││└─03.最小费用流()││└─01.最短路费用流│└─04.二分图(bipartitegraph)│├─01.二分图最大匹配()│├─02.带权二分图最优匹配()│├─03.有向图最小覆盖()│├─04.二分图最小覆盖()│└─05.延迟认可算法()├─05.字符串(string)│├─01.字典树(trie)│├─02.单模式串匹配(singlemode-stringmatch)││├─01.KMP(Knuth-Morr

7、is-Pratt)││└─02.RK(Rabin-Karp)│├─03.多模式串匹配(multi-mode-stringmatch)││└─01.确定性有限状态自动机(deterministicfinitestateautomata)│├─04.后缀数组(suffixarray)│└─05.RadixTrie(RadixTrie)└─x.01.计算几何(computinggeometry)