어려운 알고리즘 리스트 General Matching *Black Box Linear Algebra *Euler Pentagonal Number Theorem (https://www.youtube.com/results?search_query=euler%27s+pentagonal+number+theorem) Polynomial Interpolation O((N+Q)log^2N) (언급만 했다 함) *APIO 2014 Sequence NlogN (Alien Trick과 관련이 있다 함.) Suffix Array N Polya Counting Kempe Chain Weighted General Matching *Matroid Intersection Caratheodory Theorem Voronoi diagram / Delaunay triangulation Scaled Voronoi diargram Quaternion 3D Convex hull Polygon tangent 위도/경도를 포함한 구면기하 수많은 것들끼리의 교점과 접선 3차원 물체 렌더링 Suffix Array, KMP, ... eertree + Palindrom partitioning Z-algorithm Splay tree Link-cut tree Gomory-Hu tree Stoer Wagner’s Mincut Arborescence Dominator tree Vizing Segment tree beats + I-don't-know data structure Simplex Algorithm / Duality Matroid intersection / union / ++ Burnside lemma General matching tons of reducing time constant skills Kitamasa (?) Dynamic connectivity Polynomial multiplication / division / exponential / ... Grundy number / Surreal number Graph Coloring with low complexity Lindström–Gessel–Viennot lemma Kirchhoff Newton method Pollard rho tons of integration method Smallest enclosing circle Young tableau / Hook length formula Diagonalization + tons of linear algebra things (Rank, dim, etc) Gaussian elimination with low bandwidth Monge property Green’s theorem / divergence theorem / ++ Xor / And / Or convolution minimum vertex conver 1.3^n Blossom Algorithm E sqrt(V) Gaussian integer - gcd, … Euclid Geometry stuff (ex. simpson line, Menelaus' theorem, Ceva's theorem, etc) Chebyshev's Inequality Jensen's Inequality Cauchy–Schwarz inequality statistics things (exp/Poisson/etc distribution) Taylor series inclusion-exclusion Lucas Binomial/Multinomial Sterling Approximation generator function Gradiant descent / Simulated annealing Gaussian binomial coefficient line graph recognition Fermat's little theorem / Euler theorem Discrete logarithm modulo / big step - little step lehmer gcd Tonelli-Shanks primitive root, NTT (ex. 998244353 = 119 * 2^23 + 1, root = 3) Rotational Inertia & lots of physics skills LR1/2 Parsing + statical analysis Gale–Shapley Algorithm(안정적인 결혼문제) Dynamic Connectivity Dynamic MST Offline Incremental SCC(8496Godzilla, 19028링컷다이그래프) PQ_tree, CF Global Round 15 I번, 알고리즘 자료 링크 http://www.secmem.org/blog/ https://www.acmicpc.net/board/view/21870 https://codeforces.com/blog/entry/66909 https://koosaga.com/category/%EA%B3%B5%EB%B6%80?page=16 https://cp-algorithms.com/ http://blog.naver.com/kks227 http://www.tam-ref.ga/70 https://imeimi.tistory.com/category http://blog.naver.com/kks227 https://cubelover.tistory.com/?page=3 https://casterian.net/archives/254 https://blog.kyouko.moe/26?category=767011 https://blog.naver.com/onjo0127 https://blog.naver.com/jh05013 https://tataky.tistory.com/2 https://algospot.com/wiki/old/550/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98_%EB%8C%80%ED%9A%8C%EC%97%90_%ED%95%84%EC%9A%94%ED%95%9C_%EC%88%98%ED%95%99 https://gall.dcinside.com/mgallery/board/lists/?id=ps&sort_type=N&search_head=40&page=1 https://moonrabbit2.tistory.com/ https://tryalgo.org/index-en/