This list is going to be edited frequently when I find good resources to learn things.
Tools:
Graph drawing: http://mxwell.github.io/draw-graph/
Improving in CP
Dynamic Programming Optimization Problems:
http://codeforces.com/blog/entry/47932
Non Trivial DP tricks:
http://codeforces.com/blog/entry/47764
Slope Trick:
http://codeforces.com/blog/entry/47821
Floyd Warshall:
https://www.quora.com/Why-is-the-order-of-the-loops-in-Floyd-Warshall-algorithm-important-to-its-correctness/answer/Jayaprakash-Sundararaj
Manacher's Algorithm:
https://www.quora.com/What-is-Manachers-algorithm-How-can-we-use-it-to-find-all-palindromic-sub-strings-in-a-string
Meet in the middle:
http://qr.ae/R3GIji
Suffix Array - Linear time construction (DC3) explained:
http://qr.ae/R6EeWR
Fractional Cascading:
http://codeforces.com/blog/entry/21892
http://www.cs.uu.nl/docs/vakken/ga/slides5b.pdf (Page 43)
Bipartite Matching:
http://www.slideshare.net/KuoE0/acmicpc-bipartite-matching?next_slideshow=1
Algorithms and Data Structures Implementations:
https://sites.google.com/site/indy256/
Suffix Automaton
http://codeforces.com/blog/entry/20861
Binary Indexed Tree for Range Minimum Query
http://ioinformatics.org/oi/pdf/v9_2015_39_44.pdf
Binary Indexed Tree for coefficients in functions:
http://apps.topcoder.com/forums/?module=Thread&threadID=756271
SQRT Decomposition
Combinatorics:
Trie
Sweep Line
SPOJ Must Solve problems
Centroid Decomposition
Competitive programming courses
Matching in general graph
Matrix Power
Matrix Power alternative using DP
Treap
Splay Tree
Segment Tree
2D Segment Tree
Persistent Segment Tree
Ordered Sets
Data Structures
Map Short Permutation (11, 12 items) to integer
Segmented Sieve
Dynamic Connectivity
Aho-Corasick
Find primes in some interval
Suffix Tree
Suffix Array
Sieve Methods
2-SAT
Graphs
FFT
http://codeforces.com/blog/entry/14744
http://codeforces.com/blog/entry/20751
http://www.cs.cmu.edu/afs/cs/academic/class/15451-s10/www/lectures/lect0423.txt
http://codeforces.com/blog/entry/20751
http://www.cs.cmu.edu/afs/cs/academic/class/15451-s10/www/lectures/lect0423.txt
MO’s Algorithm
Game Theory
Manacher’s Algorithm
Minimum Diameter Spanning Tree
Dynamic Programming (DP)
DP with bitmasks
DP over integers
DP Optimizations
Heavy Light Decomposition
http://blog.anudeep2011.com/heavy-light-decomposition/
http://blog.anudeep2011.com/heavy-light-decomposition/
Ternary Search
Trie
Z-Algorithm
Nim Game
http://web.mit.edu/sp.268/www/nim.pdf
World Finals 2015 solutions
Andrew Stankevich Contests
Regional Contests with editorial
Training Advices
Saratov University Notebook
Complex Numbers in Geometry
https://uqu.edu.sa/files2/tiny_mce/plugins/filemanager/files/4041834/cnum_mr.pdf
Link-Cut Tree
http://www.cs.cmu.edu/~sleator/papers/dynamic-trees.pdf
http://www.cs.cmu.edu/~avrim/451f12/lectures/lect1009-linkcut.txt
Burnside's lemma
http://petr-mitrichev.blogspot.com/2008/11/burnsides-lemma.html
No comments:
Post a Comment
Leave me a comment