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

[{"title":"（68个子文件40.91MB）挑战程序设计竞赛2：算法和数据结构","children":[{"title":"源码","children":[{"title":"第18章","children":[{"title":"GreatestCommonDivisor.cpp <span style='color:#111;'>236B</span>","children":null,"spread":false},{"title":"PrimeNumbers.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":"PriorityQueue.cpp <span style='color:#111;'>1.26KB</span>","children":null,"spread":false},{"title":"CompleteBinaryTree.cpp <span style='color:#111;'>753B</span>","children":null,"spread":false},{"title":"MaximumHeap.cpp <span style='color:#111;'>864B</span>","children":null,"spread":false}],"spread":true},{"title":"第17章","children":[{"title":"LargestSquare.cpp <span style='color:#111;'>1021B</span>","children":null,"spread":false},{"title":"0-1KnapsackProblem.cpp <span style='color:#111;'>720B</span>","children":null,"spread":false},{"title":"LargestRectangle.cpp <span style='color:#111;'>2.24KB</span>","children":null,"spread":false},{"title":"LongestIncreasingSubsequence.cpp <span style='color:#111;'>697B</span>","children":null,"spread":false},{"title":"CoinChangingProblem.cpp <span style='color:#111;'>517B</span>","children":null,"spread":false}],"spread":true},{"title":"第13章","children":[{"title":"SingleSourceShortestPathII.cpp <span style='color:#111;'>1.57KB</span>","children":null,"spread":false},{"title":"SingleSourceShortestPathI.cpp <span style='color:#111;'>1.43KB</span>","children":null,"spread":false},{"title":"MinimumSpanningTree.cpp <span style='color:#111;'>1.53KB</span>","children":null,"spread":false}],"spread":true},{"title":"第8章","children":[{"title":"RootedTrees.cpp <span style='color:#111;'>2.02KB</span>","children":null,"spread":false},{"title":"ReconstructionofaTree.cpp <span style='color:#111;'>1015B</span>","children":null,"spread":false},{"title":"BinaryTrees.cpp <span style='color:#111;'>2.14KB</span>","children":null,"spread":false},{"title":"TreeWalk.cpp <span style='color:#111;'>1.43KB</span>","children":null,"spread":false}],"spread":true},{"title":"第2章","children":[{"title":"MaximumProfit.cpp <span style='color:#111;'>452B</span>","children":null,"spread":false}],"spread":true},{"title":"第15章","children":[{"title":"DiameterofaTree.cpp <span style='color:#111;'>1.54KB</span>","children":null,"spread":false},{"title":"TopologicalSort.cpp <span style='color:#111;'>1.32KB</span>","children":null,"spread":false},{"title":"ArticulationPoints.cpp <span style='color:#111;'>1.53KB</span>","children":null,"spread":false},{"title":"AllPairsShortestPath.cpp <span style='color:#111;'>1.41KB</span>","children":null,"spread":false},{"title":"MinimumSpanningTree.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":"MergeSort.cpp <span style='color:#111;'>1.18KB</span>","children":null,"spread":false},{"title":"TheNumberofInversions.cpp <span style='color:#111;'>1.13KB</span>","children":null,"spread":false},{"title":"CountingSort.cpp <span style='color:#111;'>828B</span>","children":null,"spread":false},{"title":"MinimumCostSort.cpp <span style='color:#111;'>1.25KB</span>","children":null,"spread":false},{"title":"QuickSort.cpp <span style='color:#111;'>762B</span>","children":null,"spread":false}],"spread":true},{"title":"第9章","children":[{"title":"BinarySearchTreeII.cpp <span style='color:#111;'>2.10KB</span>","children":null,"spread":false},{"title":"BinarySearchTreeIII.cpp <span style='color:#111;'>3.32KB</span>","children":null,"spread":false},{"title":"BinarySearchTreeI.cpp <span style='color:#111;'>1.63KB</span>","children":null,"spread":false}],"spread":true},{"title":"第19章","children":[{"title":"8Puzzle.cpp <span style='color:#111;'>1.76KB</span>","children":null,"spread":false},{"title":"15Puzzle1.cpp <span style='color:#111;'>2.60KB</span>","children":null,"spread":false},{"title":"8QueensProblem.cpp <span style='color:#111;'>1.53KB</span>","children":null,"spread":false},{"title":"15Puzzle2.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":"AreasontheCross-SectionDiagram.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":"DoublyLinkedList2.cpp <span style='color:#111;'>1.17KB</span>","children":null,"spread":false},{"title":"DoublyLinkedList1.cpp <span style='color:#111;'>2.26KB</span>","children":null,"spread":false}],"spread":true},{"title":"第16章","children":[{"title":"SegmentIntersectionsManhattanGeometry.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":"SelectionSort.cpp <span style='color:#111;'>703B</span>","children":null,"spread":false},{"title":"StableSort.cpp <span style='color:#111;'>1.88KB</span>","children":null,"spread":false},{"title":"BubbleSort.cpp <span style='color:#111;'>817B</span>","children":null,"spread":false},{"title":"ShellSort.cpp <span style='color:#111;'>1.12KB</span>","children":null,"spread":false},{"title":"InsertionSort.cpp <span style='color:#111;'>816B</span>","children":null,"spread":false}],"spread":true},{"title":"第11章","children":[{"title":"FibonacciNumber.cpp <span style='color:#111;'>258B</span>","children":null,"spread":false},{"title":"LongestCommonSubsequence.cpp <span style='color:#111;'>818B</span>","children":null,"spread":false},{"title":"MatrixChainMultiplication.cpp <span style='color:#111;'>714B</span>","children":null,"spread":false}],"spread":false},{"title":"第12章","children":[{"title":"DepthFirstSearch.cpp <span style='color:#111;'>956B</span>","children":null,"spread":false},{"title":"BreadthFirstSearch.cpp <span style='color:#111;'>1.07KB</span>","children":null,"spread":false},{"title":"ConnectedComponents.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":"ExhaustiveSearch.cpp <span style='color:#111;'>731B</span>","children":null,"spread":false},{"title":"KochCurve.cpp <span style='color:#111;'>1.12KB</span>","children":null,"spread":false}],"spread":false},{"title":"第5章","children":[{"title":"LinearSearch.cpp <span style='color:#111;'>759B</span>","children":null,"spread":false},{"title":"BinarySearch1.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":"BinarySearch2.cpp <span style='color:#111;'>457B</span>","children":null,"spread":false}],"spread":false},{"title":"第14章","children":[{"title":"DisjointSetUnionFindTree.cpp <span style='color:#111;'>1.41KB</span>","children":null,"spread":false},{"title":"RangeSearch(kDTree).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}]