挑战程序设计竞赛2：算法和数据结构

[{"title":"（ 68 个子文件 40.91MB ） 挑战程序设计竞赛2：算法和数据结构","children":[{"title":"源码","children":[{"title":"第18章","children":[{"title":"Greatest Common Divisor.cpp <span style='color:#111;'> 236B </span>","children":null,"spread":false},{"title":"Prime Numbers.cpp <span style='color:#111;'> 535B </span>","children":null,"spread":false},{"title":"Power.cpp <span style='color:#111;'> 433B </span>","children":null,"spread":false}],"spread":true},{"title":"第10章","children":[{"title":"Priority Queue.cpp <span style='color:#111;'> 1.26KB </span>","children":null,"spread":false},{"title":"Complete Binary Tree.cpp <span style='color:#111;'> 753B </span>","children":null,"spread":false},{"title":"Maximum Heap.cpp <span style='color:#111;'> 864B </span>","children":null,"spread":false}],"spread":true},{"title":"第17章","children":[{"title":"Largest Square.cpp <span style='color:#111;'> 1021B </span>","children":null,"spread":false},{"title":"0-1 Knapsack Problem .cpp <span style='color:#111;'> 720B </span>","children":null,"spread":false},{"title":"Largest Rectangle.cpp <span style='color:#111;'> 2.24KB </span>","children":null,"spread":false},{"title":"Longest Increasing Subsequence .cpp <span style='color:#111;'> 697B </span>","children":null,"spread":false},{"title":"Coin Changing Problem.cpp <span style='color:#111;'> 517B </span>","children":null,"spread":false}],"spread":true},{"title":"第13章","children":[{"title":"Single Source Shortest Path II.cpp <span style='color:#111;'> 1.57KB </span>","children":null,"spread":false},{"title":"Single Source Shortest Path I.cpp <span style='color:#111;'> 1.43KB </span>","children":null,"spread":false},{"title":"Minimum Spanning Tree.cpp <span style='color:#111;'> 1.53KB </span>","children":null,"spread":false}],"spread":true},{"title":"第8章","children":[{"title":"Rooted Trees.cpp <span style='color:#111;'> 2.02KB </span>","children":null,"spread":false},{"title":"Reconstruction of a Tree.cpp <span style='color:#111;'> 1015B </span>","children":null,"spread":false},{"title":"Binary Trees.cpp <span style='color:#111;'> 2.14KB </span>","children":null,"spread":false},{"title":"Tree Walk.cpp <span style='color:#111;'> 1.43KB </span>","children":null,"spread":false}],"spread":true},{"title":"第2章","children":[{"title":"Maximum Profit.cpp <span style='color:#111;'> 452B </span>","children":null,"spread":false}],"spread":true},{"title":"第15章","children":[{"title":"Diameter of a Tree.cpp <span style='color:#111;'> 1.54KB </span>","children":null,"spread":false},{"title":"Topological Sort.cpp <span style='color:#111;'> 1.32KB </span>","children":null,"spread":false},{"title":"Articulation Points.cpp <span style='color:#111;'> 1.53KB </span>","children":null,"spread":false},{"title":"All Pairs Shortest Path.cpp <span style='color:#111;'> 1.41KB </span>","children":null,"spread":false},{"title":"Minimum Spanning Tree.cpp <span style='color:#111;'> 2.20KB </span>","children":null,"spread":false}],"spread":true},{"title":"第7章","children":[{"title":"Partition.cpp <span style='color:#111;'> 762B </span>","children":null,"spread":false},{"title":"Merge Sort.cpp <span style='color:#111;'> 1.18KB </span>","children":null,"spread":false},{"title":"The Number of Inversions.cpp <span style='color:#111;'> 1.13KB </span>","children":null,"spread":false},{"title":"Counting Sort.cpp <span style='color:#111;'> 828B </span>","children":null,"spread":false},{"title":"Minimum Cost Sort.cpp <span style='color:#111;'> 1.25KB </span>","children":null,"spread":false},{"title":"Quick Sort.cpp <span style='color:#111;'> 762B </span>","children":null,"spread":false}],"spread":true},{"title":"第9章","children":[{"title":"Binary Search Tree II.cpp <span style='color:#111;'> 2.10KB </span>","children":null,"spread":false},{"title":"Binary Search Tree III.cpp <span style='color:#111;'> 3.32KB </span>","children":null,"spread":false},{"title":"Binary Search Tree I.cpp <span style='color:#111;'> 1.63KB </span>","children":null,"spread":false}],"spread":true},{"title":"第19章","children":[{"title":"8 Puzzle.cpp <span style='color:#111;'> 1.76KB </span>","children":null,"spread":false},{"title":"15 Puzzle1.cpp <span style='color:#111;'> 2.60KB </span>","children":null,"spread":false},{"title":"8 Queens Problem.cpp <span style='color:#111;'> 1.53KB </span>","children":null,"spread":false},{"title":"15 Puzzle2.cpp <span style='color:#111;'> 2.57KB </span>","children":null,"spread":false}],"spread":true},{"title":"第4章","children":[{"title":"Stack1.cpp <span style='color:#111;'> 1.12KB </span>","children":null,"spread":false},{"title":"Queue1.cpp <span style='color:#111;'> 1.52KB </span>","children":null,"spread":false},{"title":"Stack2.cpp <span style='color:#111;'> 957B </span>","children":null,"spread":false},{"title":"Areas on the Cross-Section Diagram.cpp <span style='color:#111;'> 1.09KB </span>","children":null,"spread":false},{"title":"Queue2.cpp <span style='color:#111;'> 1.03KB </span>","children":null,"spread":false},{"title":"Doubly Linked List2.cpp <span style='color:#111;'> 1.17KB </span>","children":null,"spread":false},{"title":"Doubly Linked List1.cpp <span style='color:#111;'> 2.26KB </span>","children":null,"spread":false}],"spread":true},{"title":"第16章","children":[{"title":"Segment Intersections Manhattan Geometry.cpp <span style='color:#111;'> 3.12KB </span>","children":null,"spread":false},{"title":"模板.cpp <span style='color:#111;'> 6.80KB </span>","children":null,"spread":false}],"spread":true},{"title":"第3章","children":[{"title":"Selection Sort.cpp <span style='color:#111;'> 703B </span>","children":null,"spread":false},{"title":"Stable Sort.cpp <span style='color:#111;'> 1.88KB </span>","children":null,"spread":false},{"title":"Bubble Sort.cpp <span style='color:#111;'> 817B </span>","children":null,"spread":false},{"title":"Shell Sort.cpp <span style='color:#111;'> 1.12KB </span>","children":null,"spread":false},{"title":"Insertion Sort.cpp <span style='color:#111;'> 816B </span>","children":null,"spread":false}],"spread":true},{"title":"第11章","children":[{"title":"Fibonacci Number.cpp <span style='color:#111;'> 258B </span>","children":null,"spread":false},{"title":"Longest Common Subsequence.cpp <span style='color:#111;'> 818B </span>","children":null,"spread":false},{"title":"Matrix Chain Multiplication.cpp <span style='color:#111;'> 714B </span>","children":null,"spread":false}],"spread":false},{"title":"第12章","children":[{"title":"Depth First Search.cpp <span style='color:#111;'> 956B </span>","children":null,"spread":false},{"title":"Breadth First Search.cpp <span style='color:#111;'> 1.07KB </span>","children":null,"spread":false},{"title":"Connected Components.cpp <span style='color:#111;'> 1.24KB </span>","children":null,"spread":false},{"title":"Graph.cpp <span style='color:#111;'> 561B </span>","children":null,"spread":false}],"spread":false},{"title":"第6章","children":[{"title":"Exhaustive Search.cpp <span style='color:#111;'> 731B </span>","children":null,"spread":false},{"title":"Koch Curve.cpp <span style='color:#111;'> 1.12KB </span>","children":null,"spread":false}],"spread":false},{"title":"第5章","children":[{"title":"Linear Search.cpp <span style='color:#111;'> 759B </span>","children":null,"spread":false},{"title":"Binary Search1.cpp <span style='color:#111;'> 785B </span>","children":null,"spread":false},{"title":"Allocation.cpp <span style='color:#111;'> 1.20KB </span>","children":null,"spread":false},{"title":"Dictionary.cpp <span style='color:#111;'> 1.81KB </span>","children":null,"spread":false},{"title":"Binary Search2.cpp <span style='color:#111;'> 457B </span>","children":null,"spread":false}],"spread":false},{"title":"第14章","children":[{"title":"Disjoint Set Union Find Tree.cpp <span style='color:#111;'> 1.41KB </span>","children":null,"spread":false},{"title":"Range Search (kD Tree).cpp <span style='color:#111;'> 2.35KB </span>","children":null,"spread":false}],"spread":false}],"spread":false},{"title":"挑战程序设计竞赛2 算法和数据结构.pdf <span style='color:#111;'> 55.56MB </span>","children":null,"spread":false}],"spread":true}]