POJ of the table of the small audience edition

Early:
I. Basic algorithm:
(1) enumeration. (poj1753,poj2965)
(2) Greed (poj1328,poj2109,poj2586)
(3) The method of recursion and division.
(4) recursion.
(5) Construction method. (poj3295)
(6) Simulation method. (poj1068,poj2632,poj1573,poj2993,poj2996)
Two. Graph algorithm:
(1) Depth-first traversal and breadth-first traversal of graphs.
(2) Shortest path algorithm (Dijkstra,bellman-ford,floyd,heap+dijkstra)
(poj1860,poj3259,poj1062,poj2253,poj1125,poj2240)
(3) Minimum spanning tree algorithm (Prim,kruskal)
(poj1789,poj2485,poj1258,poj3026)
(4) Topology sequencing (poj1094)
(5) Maximum matching of binary graphs (Hungarian algorithm) (poj3041,poj3020)
(6) The maximum flow augmented path algorithm (km algorithm). (poj1459,poj3436)
Three. Data structure.
(1) string (poj1035,poj3080,poj1936)
(2) Sorting (fast, merge rows (related to reverse order number), heap rows) (poj2388,poj2299)
(3) Simple and check-set application.
(4) Hash table and binary search Efficient search method (number of hash, string of hash)
(poj3349,poj3274,poj2151,poj1840,poj2002,poj2503)
(5) Huffman tree (poj3253)
(6) Heap
(7) Trie tree (static achievements, dynamic Achievements) (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 techniques and pruning (poj2531,poj1416,poj2676,1129)
Five. Dynamic planning
(1) knapsack problem. (poj1837,poj1276)
(2) Type of simple DP (refer to LRJ's book page149) as follows:
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 sub-sequence)
(poj3176,poj1080,poj1159)
3.C[I,J]=W[I,J]+OPT{C[I,K-1]+C[K,J]}. (Optimal binary search tree problem)
Six. Mathematics
(1) Combinatorial mathematics:
1. Addition principle and multiplication principle.
2. Arrange the combination.
3. Recursion relationship.
(poj3252,poj1850,poj1019,poj1942)
(2) Number theory.
1. Prime number and division of integers
2. Binary bits.
3. Same comodule operation.
(poj2635, poj3292,poj1845,poj2115)
(3) Calculation method.
1. Two-point method to solve the monotone function related knowledge. (poj3273,poj3258,poj1905,poj3122)
Seven. Computational geometry.
(1) Geometric formula.
(2) The use of cross-product and dot product (such as the determination of intersection of segments, the distance from points to segments, etc.). (poj2031,poj1039)
(3) A multilateral type of simple algorithm (area) and related judgments (points in the multilateral type, whether the multilateral type intersect)
(poj1408,poj1584)
(4) Convex bag. (poj2187,poj1113)

Intermediate:
I. Basic algorithm:
(1) Application of the standard Template Library for C + +. (poj3096,poj3007)
(2) More complex training of simulated questions (poj3393,poj1472,poj3371,poj1027,poj2706)
Two. Graph algorithm:
(1) The establishment and solution of the differential constraint system. (poj1201,poj2983)
(2) Minimum cost maximum flow (poj2516,poj2516,poj2195)
(3) Dual connected components (poj2942)
(4) strongly connected branches and their shrinking points. (poj2186)
(5) Cutting edge and cutting point of the figure (poj3352)
(6) Minimum cut model, Network Flow Protocol (poj3308,)
Three. Data structure.
(1) Segment tree. (poj2528,poj2828,poj2777,poj2886,poj2750)
(2) static binary search tree. (poj2482,poj2352)
(3) Tree Tree Group (poj1195,poj3321)
(4) RMQ. (poj3264,poj3368)
(5) and check the advanced application of the set. (poj1703,2492)
(6) KMP algorithm. (poj1961,poj2406)
Four. Search
(1) Optimization pruning and feasibility pruning
(2) Search techniques and optimizations (poj3411,poj1724)
(3) Memory Search (poj3373,poj1691)

Five. Dynamic planning
(1) more complex dynamic programming (such as dynamic programming to solve the specific problem of the implementation of the business)
(poj1191,poj1054,poj3280,poj2029,poj2948,poj1925,poj3034)
(2) Dynamic planning of recording status. (poj3254,poj2411,poj1185)
(3) Tree-type dynamic programming (poj2057,poj1947,poj2486,poj3140)
Six. Mathematics
(1) Combinatorial mathematics:
1. The principle of repulsion.
2. Drawer principle.
3. Permutation group and Polya theorem (poj1286,poj2409,poj3270,poj1026).
4. Recursion relationship and parent function.

(2) Mathematics.
1. Gaussian elimination method (poj2947,poj1487, poj2065,poj1166,poj1222)
2. Probability problems. (poj3071,poj3440)
3.GCD, extended Euclidean (Chinese remainder theorem) (poj3101)
(3) Calculation method.
1.0/1 fractional planning. (poj2976)
2. The three-point method solves the extremum of single-peak (valley).
3. Matrix Method (poj3150,poj3422,poj3070)
4. Iterative approximation (poj3301)
(4) randomization algorithm (poj3318,poj2454)
(5) Miscellaneous questions.
(poj1870,poj3296,poj3286,poj1095)
Seven. Computational geometry.
(1) discretization of the coordinates.
(2) Scan line algorithm (for example, to find the area and perimeter of a rectangle and often used with a segment tree or heap).
(poj1765,poj1177,poj1151,poj3277,poj2280,poj3004)
(3) The core of the polygon (half-plane intersection) (poj3130,poj3335)
(4) Comprehensive application of geometric tools. (poj1819,poj1066,poj2043,poj3227,poj2165,poj3429)

Senior:
I. Basic algorithm requirements:
(1) Code quickly written, streamlined but without losing style
(poj2525,poj1684,poj1421,poj1048,poj2050,poj3306)
(2) Ensure correctness and efficiency. poj3434
Two. Graph algorithm:
(1) degree limit minimum spanning tree and K-shortest. (poj1639)
(2) Shortest path, minimum spanning tree, binary graph, maximum flow problem related theory (mainly model establishment and solution)
(poj3155, poj2112,poj1966,poj3281,poj1087,poj2289,poj3216,poj2446
(3) optimal ratio spanning tree. (poj2728)
(4) Minimum tree shape (poj3164)
(5) Sub-niche into a tree.
(6) The least ring of the graph and the direction graph
Three. Data structure.
(1) Establishment and application of Trie diagram. (poj2778)
(2) LCA and RMQ Problems (LCA (recent common ancestor issues) have offline algorithms (and check set +dfs) and online algorithms
(Rmq+dfs)). (poj1330)
(3) Double-ended queue and its application (maintain a monotonous queue, often in the dynamic planning to optimize the state transfer
Purpose). (poj2823)
(4) left-leaning tree (can be combined with heap).
(5) suffix tree (very useful data structure, is also the hotspot of the Division examination Questions).
(poj3415,poj3294)
Four. Search
(1) More troublesome Search topic training (poj1069,poj3322,poj1475,poj1924,poj2049,poj3426)
(2) The state optimization of wide search: the use of M-binary number storage state, converted to string hash table weight, the position of compressed storage state, two-way wide search, a * algorithm. (poj1768,poj1184,poj1872,poj1324,poj2046,poj1482)
(3) Deep search optimization: As far as possible to use bit operations, must be added pruning, function parameters as little as possible, the number of layers is not too large, you can consider two-way search or rotation search, ida* algorithm. (poj3131,poj2870,poj2286)
Five. Dynamic planning
(1) Dynamic programming with data structure optimization is required.
(poj2754,poj3378,poj3017)
(2) Quadrilateral inequality theory.
(3) More difficult state DP (POJ3133)
Six. Mathematics
(1) Combinatorial mathematics.
1.MoBius Inversion (poj2888,poj2154)
2. Partial-order relationship theory.
(2) Game theory.
1. Maximum minimum process (poj3317,poj1085)
2.Nim problem.
Seven. Computational geometry.
(1) Semi-planar intersection (poj3384,poj2540)
(2) Establishment of visual image (poj2966)
(3) The minimum circle cover of the point set.
(4) to heel point (poj2079)
Eight. General questions.
(poj3109,poj1478,poj1462,poj2729,poj2048,poj3336,poj3315,poj2148,poj1263)

-----------------------------------------------------------------------------------------------
-----------------------------------------------------------------------------------------------
and complementary
DP state design and Equation summary

1. Incomplete status record
<1> Frog River Crossing problem
<2> using interval DP
2. Knapsack problem
<1> 0-1 Backpack, classic questions
<2> Infinity Backpack, classic question
<3> the problem of the judgement knapsack
<4> knapsack problem with affiliated relationship
<5> 1 knapsack problem
<6> double backpack to find the best value
<7> Structure Triangle problem
<8> knapsack problem with upper bound limit (012 backpack)
3. Linear dynamic Programming problems
<1> Bricks Game Issues
<2> Duel (decision-related issues)
Maximum polygon problem for <3> Circle
<4> counting the number of words
<5> Board Segmentation
<6> Scheduling issues
<7> Minimum approximation problem (find out the ratio of two to the sum of a number/two number equal to a certain number, etc.)
<8> Block Elimination game (a range can be eliminated continuously for maximum benefit)
<9> Resource Allocation issues
<10> Digital Triangle problem
<11> Beautiful Printing
<12> Post Office questions and structuring answers
<13> Tallest bricks problem
<14> two-segment continuous and maximum
The power of <15>2 and its problems
<16>n the maximum number of M segments and
<17> Cross Maximum number problem
4. DP (such as division of judgment, determination of accessibility, etc.) of the judgment question
DP for <1> mode K problem
<2> Special modulus k problem, the number of maximum (minimum) modulus K
<3> Transform number issues
5. Dynamic Programming with monotonic optimization
<1>1-sum problems
<2>2-sum problems
<3> Sequence Division problem (monotonic queue optimization)
6. Split problem (polygon split/stone merge/Circle split/Product max)
Triangulation problem of <1> convex polygon
The biggest problem of <2> product
<3> Polygon Game (operator on polygon Edge, vertex right value)
<4> Stone Merging (n^3/n^2/nlogn various optimizations)
7. Greedy Dynamic Planning
<1> Optimal Loading problem
<2> some knapsack problems
<3> Boat Problems
<4> Greedy Strategy
<5> Two-Machine scheduling problem Johnson algorithm
8. Status DP
<1> Cowboy Shooting problem (game class)
<2> state DP for Hamiltonian paths
<3> Two pivot balance problem
<4> the nearest two-part diagram of a forward graph
9. Tree-Type DP
<1> Perfect Server problem (3 states per node)
<2> the question of keeping the palace in small fat
<3> Network Pricing issues
Roaming problems in the <4> tree
The game on the <5> tree
The maximum independent set problem of <6> tree
The maximum equilibrium value problem of <7> tree
<8> minimum ring of construction tree

Http://hi.baidu.com/goodmorning0610/blog/item/562ee61b22bb461c8718bf49.html

1. Sorting

1423, 1694, 1723, 1727, 1763, 1788, 1828, 1838, 1840, 2201, 2376, 2377, 2380,
1318, 1877, 1928, 1971, 1974, 1990, 2001, 2002, 2092, 2379,

1002 (requires character processing, sorting with a quick line) 1007 (Stable sort) 2159 (test instructions is difficult to understand) 223
1 2371 (Simple sort) 2388 (sequential statistical algorithm) 2418 (binary sort tree)

2. Search, backtracking, traversal

1022 1111d 1118 1129 1190 1562 1564 1573 1655 2184 2225 2243 2312 2362 2378 238
6 1010,1011,1018,1020,1054,1062,1256,1321,1363,1501,1650,1659,1664,1753,2078
, 2083,2303,2310,2329

Simple: 1128, 1166, 1176, 1231, 1256, 1270, 1321, 1543, 1606, 1664, 1731, 1742,
1745, 1847, 1915, 1950, 2038, 2157, 2182, 2183, 2381, 2386, 2426,
Not easy: 1024, 1054, 1117, 1167, 1708, 1746, 1775, 1878, 1903, 1966, 2046, 2197,
2349,
Recommended: 1011, 1190, 1191, 1416, 1579, 1632, 1639, 1659, 1680, 1683, 1691, 1709,
1714, 1753, 1771, 1826, 1855, 1856, 1890, 1924, 1935, 1948, 1979, 1980, 2170,
2288, 2331, 2339, 2340,1979 (similar to Maze) 1980 (Higher pruning requirements)

3. Calendar

1008 2080 (Be careful with this question)

4. Enumeration

1012,1046, 1387, 1411, 2245, 2326, 2363, 2381,1054 (higher pruning requirements), 16
50 (decimal precision problem)

5, data structure of the typical algorithm

Easy: 1182, 1656, 2021, 2023, 2051, 2153, 2227, 2236, 2247, 2352, 2395,
Not easy: 1145, 1177, 1195, 1227, 1661, 1834,
Recommended: 1330, 1338, 1451, 1470, 1634, 1689, 1693, 1703, 1724, 1988, 2004, 2010,
2119, 2274, 1125 (Freud algorithm), 2421 (the smallest spanning tree of graphs)

6. Dynamic Planning

1037 A Decorative Fence,

1050 to the Max,

1088 skiing,

1125 stockbroker Grapevine,

1141 Brackets Sequence,

1159 Palindrome,

1160 Post Office,

1163 the Triangle,

1458 Common Subsequence,

1579 Function Run Fun,

1887 Testing the CATCHER,

1953 World Cup Noise,

2386 Lake Counting

7. Greed

1042, 1065, 1230, 1323, 1477, 1716, 1784,1328 1755 (or Simplex method), 2054,10
17, 1328,1862, 1922, 2054, 2209, 2313, 2325, 2370.

8. Simulation

Easy: 1006, 1008, 1013, 1016, 1017, 1169, 1298, 1326, 1350, 1363, 1676, 1786,
1791, 1835, 1970, 2317, 2325, 2390,

Not easy: 1012, 1082, 1099, 1114, 1642, 1677, 1684, 1886,1281 1928 2083 2141 2015

9. Recursion

1664

10. String processing

1488, 1598, 1686, 1706, 1747, 1748, 1750, 1760, 1782, 1790, 1866, 1888, 1896,
1951, 2003, 2121, 2141, 2145, 2159, 2337, 2359, 2372, 2406, 2408, 1016 1051 11
26 1318 1572 1917 1936 2039 2083 2136 2271 2317 2330,2121 2403

11. Number theory

1006,1014,1023,1061,1152,1183,1730,2262

12. Geometry-related Topics

Convex bag: 1113, 1228, 1794, 2187,1113 wall,2187 beauty contest

Easy: 1319, 1654, 1673, 1675, 1836, 2074, 2137, 2318,
Not easy: 1685, 1687, 1696, 1873, 1901, 2172, 2333,

13, arbitrary precision operation, digital game, high-precision calculation

1001 1023 1047 1060 1079 1131 1140 1142 1207 1220 1284 1289 1306 1316 1338 140
5 1454 1503 1504 1519 1565 1650 1969 2000 2006 2081 2247 2262 2305 2316 2389

1001, 1220, 1405, 1503,1001 (high-precision multiplication) 2413 (high-precision addition, and binary search)

14. Probability statistics

1037,1050

15, small cost maximum flow, maximum flow

2195 going home,2400 supervisor, supervisee,1087 a plug for unix,1149 PIGS,
1273 Drainage ditches,1274 the perfect stall,1325 machine schedule,1459 POW
ER network,2239 selecting courses

16, compressed storage of DP

1038 Bugs Integrated inc,1185 artillery position, 2430 lazy cow

17. The longest common substring (LCS)

Human gene functions,1159 palindrome,1458 Common subsequence,2192 Zipp
Er

18. Graph Theory and combinatorial mathematics

2421 Constructing Roads,

2369 permutations,

2234 Matches Game,

2243 Knight Moves,

2249 Binomial Showdown,

2255 Tree Recovery,

2084 Game of Connections,

1906 three Powers,

1833 permutations,

1850 Code,

1562 oil deposits,

1496 Word Index,

1306 combinations,

1125 stockbroker Grapevine,

1129 Channel Allocation,

1146 ID Codes,

1095 Trees made to Order, find law

2247 Humble Numbers,

2309 BST,

2346 Lucky Tickets,

2370 Democracy in danger,

2365 Rope,

2101 Honey and Milk Land
2028 when Can We Meet?,

2084 Game of Connections,

1915 Knight Moves,

1922 Ride to School,

1941 The Sierpinski Fractal,

1953 World Cup Noise,

1958 Strange Towers of Hanoi,

1969 Count on Canton,

1806 Manhattan 2025,

1809 Regetni,

1844 Sum,

1870 Bee Breeding,

1702 Eva\ ' s Balance,

1728 a flea on a chessboard,

1604 Just the Facts,

1642 Stacking Cubes,

1656 Counting Black,

1657 Distance on Chessboard,

1662 CoIns,

1663 number Steps,

1313 Booklet Printing,

1316 Self Numbers,

1320 Street Numbers,

1323 Game Prediction,

1338 Ugly Numbers,

1244 Slots of Fun,

1250 Tanning Salon,

1102 Lc-display,

1147 Binary codes,

1013 Counterfeit Dollar,

19. Game Class

1067 take the stone game,

1740 A New Stone Game,

2234 Matches Game,

1082 Calendar Game,

2348 euclid\ ' s Game,

2413 How many Fibs?,

2419 Forest

20, simple, simulation questions
1001 exponentiation,

1002 487-3279,

1003 Hangover,

1701 Dissatisfying Lift,

2301 Beat the spread!,

2304 Combination Lock,

2328 guessing Game,

2403 Hay Points,

2406 Power Strings,

2339 Rock, Scissors, Paper,

2350 Above Average,

2218 Does This do Me look Fat?

2260 Error Correction,

2262 goldbach\ ' s conjecture,

2272 Bullseye,

2136 Vertical Histogram,

2174 decoding Task,

2183 Bovine Math Geniuses,

Gold Coins,

Flow Layout,

2051 Argus,

2081 Calendar,

1918 Ranking List,

1922 Ride to School,

1970 The Game,

1972 Dice Stacking,

1974 The Happy Worm,

1978 Hanafuda Shuffle,

1979 Red and Black,

1617 Crypto Columns,

1666 Candy sharing Game,

1674 sorting by swapping,

1503 Integer Inquiry,

1504 Adding reversed Numbers,

1528 Perfection,

1546 basically Speaking,

1547 Clay Bully,

1573 Robot Motion,

1575 easier done Than said?

1581 A contesting decision,

1590 Palindromes,

1454 factorial frequencies,

1363 Rails,

1218 the DRUNK jailer,

1281 MANAGER,

1132 Border,

1028 Web Navigation,

21. Elementary Mathematics

1003 Hangover,

1045 Bode Plot,

1254 Hansel and Grethel,

1269 intersecting Lines,

1401 Factorial,

1410 intersection,

2363 Blocks,

2365 Rope,

2242 the circumference of the Circle,

2291 Rotten Ropes,

2295 A DP problem,

2126 Factoring a polynomial,

2191 Mersenne Composite Numbers,

2196 Specialized Four-digit Numbers,

1914 Cramer\ ' s Rule,

1835 Astronauts,

1799 yeehaa!,

1607 Deck,

1244 Slots of Fun,

1269 intersecting Lines,

1299 Polar Explorer,

1183 application of the inverse tangent function,

22. Matching

1274, 1422, 1469, 1719, 2060, 2239,

------------------------------------------------------------------------------
-------------

Classic
1011 (search for a good question)
1012 (Learn to play the table)
1013
1019 (It embodies many of the characteristics of such problems)
1050 (Absolute classic DP)
1088 (DP good question)
1157 (flower shop, classic DP)
1163 (How about the classic DP so much ah??? ）
1328 (greedy)
1458 (longest common sub-sequence)
1647 (very good real problem, accurate and quick analysis of the test)
1654 (triangular method for learning polygon area)
1655 (a type of DP problem with no root tree)
1804 (Reverse pair)
2084 (Classical combinatorial math problem)
2187 (with convex hull to find the farthest point pair, the convex hull should have an O (N) of the method, but I can not be adjusted out)
2195 (best match for binary graphs)
2242 (Computational geometry Classic)
2295 (Equation processing)
2353 (DP, but to record the best path)
2354 (solid analytic geometry)
2362 (search for a good question)
2410 (reading the question is the key)
2411 (classic DP)

Interesting
1067 (difficult mathematics, but careful study, is a vast field)
1147 (with O (n) algorithm, need to think)
1240 (until a tree's sequence and post-order traversal, then there are several middle sequence traversal it?) dp
1426 (Is it number theory?) Wrong, it's graph theory! ）
1648 (Do not use computational geometry, the whole point of this feature to bypass the obstacle of precision)
1833 (rule-finding)
1844 (seemingly DP or search, in fact, is an interesting math problem)
1922 (greedy, haha)
2231
2305 (no need for high precision OH)
2328 (Be careful OH)
2356 (number theory knowledge)
2359 (variant of the Joseph question)
2392 (Interesting question)

A very complex question.
1001
1008
1087 (the composition is annoying, there is the maximum match of the binary graph)
1128 (Usaco)
1245
1329
1550 (the exam is reading and understanding ability)
1649 (DP)
2200 (String Processing + enumeration)
2358 (enumerating and avoiding repetition are annoying)
2361 (carefully carefully again carefully)

Problem
1014 (mathematics proves to be difficult, but it is more important to have that idea)
1037 (more difficult DP)
1405 (high-precision algorithm is also divided into grades, and constantly improve it)
2002 (Do not know if there is more algorithm than O (N^2*LOGN)? ）
2054 (very difficult, very strong thinking ability)
2085 (Combinatorial mathematics)
2414 (DP, but to prune)
2415 (search)
2423 (Computational geometry + statistics)

More Problem Solving
1002 (can be sorted, can also be used as a statistical method)
1338 (both search and DP are available)
1664 (Search and DP both practice it)
2082 (This is the question I'm talking about.)
2352 (the barrel and the two fork tree are OK)

Note:
1011: Very classic scissors
1014: Difficult in mathematics
1017: Rigorous mathematical proof seems to be not easy
1021: A little complex, the study of the graphics of various rotation processing
1083: Smart Thinking angle
1150: Split-odd-even discussion, LG (n) algorithm
1218: Three line is enough, although simple, but also have the pros and cons of the
1505: two points plus greed
1654: The practice may be many, I use the area to do
1674: Count the number of loops (graph bar)
1700: Math proves not easy
1742:o (m*n) algorithm
1863: Be patient and write slowly ... ^_^
1988: and check Set
2051: Heap
2078: Not difficult, but the scissors can do very well
2082::o (n), do you have any idea?
2084: Number of Cattleya
2182: Segment Tree
2195: Minimum cost maximum flow
2234: Classical Game algorithm
2236: And check Set
2299: The dichotomy of thought
The extension of 2395:kruskal minimum spanning tree
2406:kmp
2411: Using a binary string to represent the state

POJ of the table of the small audience edition