2014 winter vacation training plan preliminary edition

Each topic will end with a 5-hour special competition ~

1. hustOJ currently supports Google browsers and other browsers.

2. Welcome ~

3. recommended books for this phase: a classic training guide for algorithm competitions (Liu rujia)

4. Question solution Report: most of the questions in the topic are classic questions. Baidu search has a detailed answer ~

5. Mark the red letters of the topic-related knowledge points. We recommend that you use the Baidu red letter to help you learn the topic ~

======================================

BFS + DFS search topics:Http://acm.hust.edu.cn/vjudge/contest/view.action? Cid = 39334 # overview)

(Note: Binary state compression, debugging, and time complexity)

Recommended topic materials:Just click a few questions ~ (Getting started with the white book)

Special competition:The topic is not over yet. Stay tuned!

Important Question Types:The topic is not over yet. Stay tuned!

Topic Overview:The topic is not over yet. Stay tuned!

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

 

·And query sets, Minimum Spanning Tree, recurrence, and cool

 

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

 

·Backpack, quick power, prime number, binary search

 

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

 

·Priority queue (minimum heap), State compression, spfa

 

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

 

·Tree traversal, simple game, and Euler's path

 

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

 

·Network Flow

 

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

 

·Digital dp, monotonous queue, rolling array, minimum cut theorem, cost flow

 

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

 

·Lazy operations on Complete Binary Tree, line segment tree, and line segment tree

 

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

 

·The center of gravity of the cut top and bridge and tree in an undirected graph

 

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

 

·Undirected graph connected components

 

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

 

·Strongly Connected Component and point reduction of a Directed Graph

 

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

 

·Dictionary tree, KMP

 

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

 

·RMQ problems, converting LCA to RMQ, tree Array

 

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

 

·Expand Euclidean and AC automatic machines

 

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

 

·2-SAT, binary matching, and base sorting

 

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

 

·Suffix Array

 

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

 

·Suffix Automation

 

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

 

 ·Secondary Generation tree and interval dp

 

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