I am reading a book summary
This morning I read topological sorting, DFS + pruning, equivalent to a little review, write three good examples. Algorithm Competition Guide 93 to 109.
+ 1 Compression state topological sorting https://www.cnblogs.com/2462478392Lee/p/11285039.html
2.DFS + pruning https://www.cnblogs.com/2462478392Lee/p/11285065.html
3.DFS + + pruning mathematics https://www.cnblogs.com/2462478392Lee/p/11285085.html
Afternoon multi-school summary
A word dish!
Evening light seemed to know a bit Chairman tree https://blog.csdn.net/creatorx/article/details/75446472 this blog is very good.
Now simply talk about their knowledge of the Chairman of the tree, the tree known as the Chairman may persist tree line, his idea is, through the construction of n tree line, each segment is the number of trees saved each number that appears in that interval, then using the segment tree may be increased or decreased resistance to related operations. K is typically used to first find a large number of sections, the number of leaf nodes from left to right as indicated by an increase in turn, it is easy to seek its large numbers K.
Then I put the tree Hang electrical multi-correction yesterday, the President of the subject up, and also make up a cow off more school today dp title, as well as a previous question.
1. The President tree + half https://www.cnblogs.com/2462478392Lee/p/11285439.html
2.dp + permutations https://www.cnblogs.com/2462478392Lee/p/11285513.html
3. random number to find the law https://www.cnblogs.com/2462478392Lee/p/11285687.html
Training experience
Or to well-read, easy to learn more knowledge, is still food.