A basic algorithm:
(1) enumeration (poj1753, poj2965).
(2) greedy (poj1328, poj2109, poj2586)
(. 3) and the partition recursive method.
(4) recursion.
(5) configured method (poj3295. )
. (6) simulation (poj1068, poj2632, poj1573, poj2993, poj2996)
. two graph algorithms:
depth-first traversal and breadth (1) in FIG first traversal
(2) shortest path algorithm (dijkstra, bellman-ford, floyd , Dijkstra heap +) (poj1860, poj3259, poj1062, poj2253, poj1125, poj2240)
(. 3) minimum spanning tree algorithm (Prim, Kruskal) (poj1789, poj2485, poj1258, poj3026)
(. 4) topological sorting (poj1094)
(. 5) maximum matching of bipartite graphs (Hungarian algorithm) (poj3041, poj3020)
augmenting path algorithm (6) maximum flow (KM algorithm). (poj1459, poj3436)
three data structure.
(1) string (poj1035, poj3080, poj1936)
(2) Sort (fast row, go side by side (the number of reverse-related), the stack row) (poj2388, poj2299)
(. 3) simple disjoint-set application.
(4) a hash table and a binary search, such as efficient search method (number of the Hash, string Hash) (poj3349, poj3274, POJ2151 , poj1840, poj2002, poj2503)
(5) the Huffman tree (poj3253)
(. 6) the stack
(7) trie tree (achievements static and dynamic contribution) (poj2513)
four simple search
(1) depth first search (poj2488, poj3083, poj3009, poj1321 , poj2251)
(2) breadth-first search (poj3278, poj1426, poj3126, poj3087.poj3414)
(3) simple search tips and pruning (poj2531, poj1416, poj2676,1129)
V. dynamic programming
(1) knapsack problem. (poj1837, poj1276)
(2) the following table of simple DP type (refer to the book page149 lrj):
1.E [J] opt = {D + W (I, J)} (poj3267, poj1836, poj1260, poj2533)
2.E [I , j] = opt {D [ i-1, j] + xi, D [i, j-1] + yj, D [i-1] [j-1] + zij} ( longest common subsequence)
( poj3176, poj1080, poj1159)
3.C [I, J] = W [I, J] + opt {C [I,. 1-K] + C [K, J]}. (optimal binary search tree problem)
six mathematical
(1) Combinatorial Mathematics:
1. principle addition and multiplication principle
. permutations 2.
3. recursion relations (POJ3252, poj1850, poj1019, poj1942)
. (2) On the number
1 and the prime number divisible problem
2. Flow bit system.
3. congruent modulo operation. (Poj2635, poj3292, poj1845, poj2115)
(. 3) calculation.
1. dichotomy solve monotonic function knowledge. (Poj3273, poj3258, poj1905, poj3122)
VII. Computational geometry.
(1) geometry formulas.
(2) the cross product and the dot product use (e.g., intersects the line segment is determined, distance between the point line, etc.). ( poj2031 , poj1039 )
(. 3) polygon simple algorithm (mensuration) and related decision (point in the polygon, polygon intersects) ( poj1408 , poj1584 )
(. 4) convex hull. ( poj2187 , poj1113 )