I learned from the CSP can not get the first prize there are 34 - 16 days
I too hard
Unlike other dalao I still have the same confidence ready to take a CSP, to be honest I regret to pay the exam, anyway, not any prizes ... (Disgraced)
To (date of October 2019 13) tomorrow Day 1, I began to plan it, because I was too this konjac konjac, and I do not even know what to test, modify the plan halfway and then slowly it.
Day 1
Sorting and retrieval STL test vector set priority_queue stacks and queues
(Saying it is not that sort and STL)
Day 2
Binary trees and linked lists (binary number, traverse the level, recursive traversal) non-binary tree
Day 3
DFS request seeking the shortest link block BFS topological sort Euler (Euler path)
Day 4
Selection of the title race training reference (only understands the meaning of the questions and practice, does not actually make)
Day 5
Re-generate (not re) arrangement arranged to answer a subset tree generated
Day 6
Other applications path backtracking to find iterative deepening search (write example)
Day 7
Selection of the title race training reference (required ibid)
Day 8
Sorting Algorithm Analysis and Retrieval preliminary talk
Day 9
Recursive greedy and divide and conquer method of backpack-related issues
Day 10
Range of issues related to greedy Huffman coding
Day 11
Algorithm Design and Optimization Strategy Selection of the title race training reference (required ibid)
Day 12
Description of the problem and state definition memory recursive search and
DAG longest road model and its lexicographically
Day 13
The longest path and the shortest of a fixed end and Application Examples Summary