### Guess.Who's blog

By Guess.Who, history, 8 days ago,

Hey Guys

I've been practicing on solving data structures problems, and as you know, to solve data structures problems, you need to know those data structures, and every time i search for a new one, i find nothing but stl structures like set and map

I already know : Z-Array, String Suffix Structure, Segment Tree, BIT, Trie, Graph, Merge Sort Tree, Binary Search Tree And now i am learning Palindromic Tree

Is there anything new you can provide to me ?

• -20

 » 8 days ago, # |   +8 dsu, sqrt decomposition, treap, sparse table...
 » 8 days ago, # |   0 This should last you your entire CP career: https://codeforces.com/blog/entry/55274?f0a28=1
 » 8 days ago, # | ← Rev. 4 →   +84 Extended persistent dynamic implicit Li Chao tree Extended lazy dynamic persistent segment tree beats 3D Convex Hull in 3D Dominator Tree Voronoi Diagran Vorona Diagram Suffix tree Matroid intersection Maximum bipartite matching Number theoretical transform Link-cut tree Persistent lazy treaps Merge Sort Tree Mo's Algorithm in 3D SQRT Decomposition Reachability tree RMQ in O(n)/O(1) Generating functions The Clock Algorithm Chinese remainder theorem Extended Euclidean Algorithm Divide and Conquer DP Suffix Automaton Gauss Elimination Convex Hull trick Half plane intersection DFS Tree BFS Tree Dinic's Algorithm Optimized Farach Colton and Bender HLD Sprague-Grundy Errichto's trick Wavelet Tree Disjoint Sparse table 2D Lazy Segment tree Polynomial segment tree Fenwick tree Augmented DSU DSU Segment tree Cartesian tree Permutation Tree Knuth Optimization Bounded Knapsack Subset Sum Convolution Trie Meet in The Middle (I would like to thank mesanu for teaching it to me when I visited the beautiful Chisinau during tst.) General weighted matching Purice's trick Global Minimum Cut of Dynmaic Start Augmented Graph Chordal Graph Recognition Rudy's trick Persistent Data structures Suffix Array in O(n) Radewoosh trick Parallel binary search Schreier–Sims Algorithm K-th Root of a Permutation Lindstrom–Gessel–Viennot lemma Fractional knapsack Registers trick Mos on Tree Sweepline 2D Sparse table D'esopo Pape Randomized heap Tarjan's off-line algorithm for Strongly Connected Components Kosaraju's algorithm for Strongly Connected Components Min cost Max Flow Dynamic connectivity DSU Rollbacks Marinush
•  » » 8 days ago, # ^ |   +14 you forgot mesanu's trick smh...
•  » » » 8 days ago, # ^ |   +15 I am sorry.Marinush
•  » » » » 8 days ago, # ^ |   +11 I hate you
•  » » » » » 8 days ago, # ^ |   0 Success makes so many people hate you. I wish it wasn't that way. It would be wonderful to enjoy success without seeing envy in the eyes of those around you.Marinush
•  » » » 8 days ago, # ^ |   0 Scuze, eu nu bag bulanale.Marinush
•  » » » » 8 days ago, # ^ |   0 Scuze, eu nu te-am întrebat.
 » 8 days ago, # |   +14
•  » » 8 days ago, # ^ |   0 Sa nu iti fie cu suparare, dar ar fi optimal daca ai vorbi doar cand ai ceva cu adevarat util de adaugat la conversatie.
 » 8 days ago, # |   +10 fyi I don't know palindromic tree
•  » » 8 days ago, # ^ |   +27 that'd explain why you're stuck at grandmaster.
•  » » » 8 days ago, # ^ |   0 "stuck at grandmaster"
•  » » » 8 days ago, # ^ |   +4 I want to be stuck at grandmaster :D
•  » » » » 8 days ago, # ^ |   0 Ma indoiesc ca vei ajunge la asa performanta. Totusi iti recomand sa citesti asta ca sa intelegi de ce.Marinush
•  » » » » » 7 days ago, # ^ |   +5 Sir, please stop using my natal language to belittle people
•  » » » » » » 7 days ago, # ^ | ← Rev. 3 →   0 Imi pare rau de cunostinta.Marinush
•  » » » » » 7 days ago, # ^ |   +5 Nu voi ajunge atât de departe și știu asta. Spuneam doar că a fi blocat în Grandmaster nu este chiar atât de rău.
•  » » 7 days ago, # ^ |   +15 That is why you don't have gold in RMI
 » 8 days ago, # |   +64 this blog is the perfect representation of why people say cyans implement link cut trees better than reds