Poj of Liu rujia's black book

I. Dynamic Planning
References:
Liu rujia: algorithm art and informatics Competition
Introduction to Algorithms

Recommended questions:
Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1141
Simple

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2288
Moderate, classic TSP problems

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2411
Medium, status compressed DP

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1112
Moderate

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1848
Medium, tree-like DP.
Tree Model in the Dynamic Planning Section of algorithm art and informatics Competition

Http://acm.zju.edu.cn/show_problem.php? PID = 1, 1234
Medium: exercise in the competition for algorithm art and Informatics

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1947
Medium: exercise in the competition for algorithm art and Informatics

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1946
Medium: exercise in the competition for algorithm art and Informatics

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1737 (combined mathematics + high precision)
Moderate, recursive

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1821
Moderate, redundant computing needs to be reduced

Http://acm.zju.edu.cn/show_problem.php? PID = 1, 2561
Simple Application of medium and quadrilateral Inequalities

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1038
Difficult, State compression DP, answered in algorithm art and informatics Competition

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1390
Difficult: answers in the competition of algorithm art and Informatics

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 3017
Difficult, need to work with Data Structure Optimization (my question ^_^)

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1682
Difficult to write

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2047
Hard

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2152
Hard, tree-like DP

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 3028
Difficult, status compression DP, interesting questions

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 3124
Hard

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2915
Very difficult

2. Search
References:
Liu rujia: algorithm art and informatics Competition
Recommended questions:
Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1011
Simple, Deep Search

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1324
Moderate, wide search

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2044
Moderate, wide search

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2286
Difficult, wide search

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1945
Hard, Ida *, iterative deepening of search, requiring better heuristic functions

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2449
Hard, repeatable K. The shortest path is *.
Refer to the solution report:
Http://acm.pku.edu.cn/JudgeOnline/showcontest? Contest_id = 1144

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1190
Difficult, deep search and pruning, answered in the competition of algorithm art and Informatics

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1084
Difficulties: Exercise in algorithm art and informatics Competition

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2989
Hard, Deep Search

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1167
Difficult: answers in the competition of algorithm art and Informatics

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1069
Difficult

Iii. Common Data Structures
References:
Liu rujia: algorithm art and informatics Competition
Introduction to Algorithms
Line Segment tree data:
Http://home.ustc.edu.cn /~ Zhuhcheng/ACM/segment_tree.pdf
Tree Array
Http://home.ustc.edu.cn /~ Zhuhcheng/ACM/tree.ppt
You can find more information about the line segment tree and tree array on the Internet.
Suffix Array
Http://home.ustc.edu.cn /~ Zhuhcheng/ACM/suffix_array.pdf
Http://home.ustc.edu.cn /~ Zhuhcheng/ACM/linear_suffix.pdf

Recommended questions
Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2482
Difficult, line segment tree application, answered in algorithm art and informatics Competition

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1151
Simple: The line segment Tree applies the rectangular area and has answers in the competition of algorithm art and Informatics

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 3225
Difficult. For more information about how to use the line segment tree, see the solution report.
Http://acm.pku.edu.cn/JudgeOnline/showcontest? Contest_id = 1233

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2155
Difficult, two-dimensional tree array.

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2777
Medium, line segment tree application.

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2274
Difficulties, heap application, answered in the competition of algorithm art and Informatics

Http://acm.zju.edu.cn/show_problem.php? PID = 1, 2334
Moderate, left-biased tree, binary heap, or other applications that can be merged.
Left tree reference http://www.nist.gov/dads/HTML/leftisttree.html
For more information, see Introduction to algorithms.

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1182
Medium, and query set

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1816
Moderate, Dictionary tree

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2778
Difficult, multi-string matching tree
Reference: http://home.ustc.edu.cn /~ Zhuhcheng/ACM/zzy2004.pdf

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1743
Hard, suffix Array

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2774
Hard, Longest Common substring, classic problem, suffix Array

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2758
Difficult, suffix Array
Refer to solution report
Http://acm.pku.edu.cn/JudgeOnline/showcontest? Contest_id = 1178

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2448
Difficult, comprehensive use of data structures

Iv. graph theory basics
References:
Liu rujia: algorithm art and informatics Competition
Introduction to Algorithms
Xie Zheng, network algorithm and Complexity Theory

Recommended questions:
Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2337
Simple, Euler's path

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 3177
Medium, undirected graph edge Cutting

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2942
Hard, undirected graph dual-connected branch

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1639
Medium, minimum limit Spanning Tree, answers in competition of algorithm art and Informatics

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2728
Medium, least Ratio Spanning Tree, answered in algorithm art and informatics Competition

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 3013
Simple, most short-circuit problem

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1275
Medium, differential constraint system, Bellman-Ford solutions, answers in algorithm art and informatics Competition

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1252
Simple, Bellman-Ford

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1459
Medium, Network Flow

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2391
Difficult, Network Flow

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1325
Moderate, maximum matching of Two-part Graph

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2226
Difficult. Maximum matching of two diagrams

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2195
Moderate, maximum two-part graph Weight Matching
For more information about KM algorithms, see network algorithms and complexity theory.

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2516
Difficult. Maximum Weight Matching of Two Graphs

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1986
Moderate, LCA (recent public ancestor) Problems
For more information, see Chapter 21st exercise of Tarjan's LCA algorithm introduction to Algorithms

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2723
Difficult, 2-SAT problems
Reference: http://home.ustc.edu.cn /~ Zhuhcheng/ACM/2-sat.ppt

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2749
Difficult, 2-SAT problems

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 3164
Difficult, minimum tree structure
Refer to Zhu-Liu Algorithm in network algorithm and Complexity Theory

V. Number Theory and combined counting Basics
Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1811
Simple, prime number determination, large number Decomposition
Introduction to Algorithms

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2888
More difficult, Burnside Theorem

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2891
Medium, modulus Equations

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2154
Moderate, classic problem, polia Theorem

Http://cs.scu.edu.cn/soj/problem.action? Id = 2703
Difficult, excellent question, Burnside theorem + Model Linear Equations

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2764
Difficult. mathematical methods are required. This method is described in chapter 7 of "Specific mathematics ".

Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1977

Simple, rapid Matrix Multiplication

From http://hi.baidu.com/%D0%B1%B7%E7%C7%E0%F3%E8/blog/item/b9cff01cb1a16d1034fa41f5.html