A basic algorithm:
(1) using standard template library of C ++ (poj3096, poj3007)
(2) training the more complex analog question (poj3393, poj1472, poj3371, poj1027 , poj2706)
two graph algorithms:
(1) establishing and solving the differential restraint system. (poj1201, poj2983)
(2) minimum cost maximum flow (poj2516, poj2516, poj2195)
(. 3) bis communication component (poj2942)
(. 4) and the condensing point strongly connected components. (poj2186)
cutting edge and cutting point (poj3352) (5) Figure
(6) minimum cut model, network flow statute (poj3308,)
III. data structure
(1) segment tree. (poj2528, poj2828, poj2777, poj2886, poj2750)
( 2) static binary search tree. (poj2482, poj2352)
(. 3) dendritic tree group (poj1195, poj3321)
(. 4) RMQ. (poj3264, poj3368)
(. 5) and check advanced application set. (poj1703,2492)
(6) KMP algorithm. (poj1961, poj2406)
IV. Search
(1) optimize the pruning and pruning feasibility
(2) optimization techniques and search (poj3411, poj1724)
(3) memory search (poj3373, poj1691)
V. dynamic programming
(1) more complex dynamic programming (e.g., Dynamic programming special purposes commercially problems) (poj1191, poj1054, poj3280, poj2029, poj2948, poj1925, poj3034)
dynamic programming (2) recording state. (POJ3254, poj2411, poj1185 )
(3) tree dynamic programming (poj2057, poj1947, poj2486, poj3140 )
MATHEMATICS.
(1) a combination of mathematics:
1. inclusion-exclusion principle.
2. drawer principle.
3. permutation group and Polya Theorem (poj1286, poj2409, poj3270 , poj1026).
4. recursion relations generating function.
(2) mathematical.
Gaussian elimination method (poj2947, poj1487, poj2065, poj1166, poj1222)
2. probability. (poj3071, poj3440)
3.GCD, extended Euclid (Chinese remainder theorem) (poj3101)
(3) calculation.
1.0 / 1 planning score. (Poj2976)
2. Solution tripartition singlet (single valley) of extrema
3. matrix method (poj3150, poj3422, poj3070)
4. iterative approximation (poj3301)
( 4) a random algorithm (poj3318, poj2454)
(. 5) hetero title. (poj1870, poj3296, poj3286, poj1095)
VII. computational geometry.
(1) coordinate discretized.
(2) scan line algorithm (e.g., a rectangular area required and circumference and is often used together and the segment tree or heap).
( poj1765 , poj1177, poj1151, poj3277, poj2280, poj3004)
(. 3) polygonal core (half plane cross) (poj3130, poj3335)
(. 4) tool geometry integrated application. (poj1819, poj1066, poj2043, poj3227, poj2165, poj3429)
advanced: