notes
DP
Divide and Conquer DP
Longest Common Subsequence
Mochila
SOS DP
Subset sum
Extra
notes
Matematica
2-SAT
Avaliacao de Interpolacao
Berlekamp-Massey
Binomial Distribution
Convolucao de GCD / LCM
Coprime Basis
Crivo de Eratosthenes
Deteccao de ciclo - Tortoise and Hare
Division Trick
Equacao Diofantina Linear
Euclides estendido
Exponenciacao rapida
Fast Walsh Hadamard Transform
FFT
Gauss
Gauss - Z2
Integracao Numerica
Inverso Modular
Karatsuba
Logaritmo Discreto
Miller-Rabin
Multipoint Evaluation And Interpolation
NTT
Operacoes em Polinomios e Series de Potencias
Pollard's Rho Alg
Produto de dois long long mod m
Simplex
Teorema Chines do Resto
Totiente
notes
Primitivas
Aritmetica Modular
Big Integer
Calendario
Fracao
Geometria
Geometria - inteiro
Geometria 3D
Matriz
Matroid
notes
Estruturas
BIT
BIT 2D
BIT com update em range
BIT-Sort Tree
Convex Hull Trick Dinamico
Convex Hull Trick Estatico
DSU
Li-Chao Tree
Li-Chao Tree - Lazy
MergeSort Tree
Min queue - deque
Min queue - stack
Order Statistic Set
Priority Queue DS
Range color
RMQ <O(n), O(1)> - min queue
Segtree
SegTreap
SegTree
SegTree 2D Iterativa
SegTree Beats
SegTree Colorida
SegTree Esparsa - Lazy
SegTree Esparsa - O(q) memoria
SegTree Iterativa
SegTree Iterativa com Lazy Propagation
SegTree PA
SegTree Persistente
SegTree Persistente com Lazy
SlopeTrick
Sparse Table
Sparse Table Disjunta
Splay Tree
Splay Tree Implicita
Split-Merge Set
Split-Merge Set - Lazy
SQRT Tree
Treap
Treap Implicita
Treap Persistent Implicita
Wavelet Tree
notes
Grafos
AGM Direcionada
Articulation Points
Bellman-Ford
Block-Cut Tree
Blossom
Centro de arvore
Centroid
Centroid decomposition
Dinitz
Dominator Tree
Euler Path / Euler Cycle
Euler Tour Tree
Functional Graph
Hopcroft Karp
Isomorfismo de arvores
Johnson
Kruskal
LCA-HLD
HLD - aresta
HLD - vertice
HLD sem Update
LCA com binary lifting
LCA com HLD
LCA com RMQ
Line Tree
Max flow com lower bound
MinCostMaxFlow
Prufer code
Sack (DSU em arvores)
Stable Marriage
Tarjan para SCC
Topological Sort
Vertex cover
Virtual Tree
Centroid Tree
Dijkstra
Floyd-Warshall
Kosaraju
Kuhn
LCT
Link-cut Tree
Link-cut Tree - aresta
Link-cut Tree - vertice
notes
Problemas
Angle Range Intersection
Area da Uniao de Retangulos
Area Maxima de Histograma
Binomial modular
Closest pair of points
Coloracao de Grafo de Intervalo
Conectividade Dinamica DC
Conectividade Dinamica LCT
Conj. Indep. Maximo com Peso em Grafo de Intervalo
Convex Hull Dinamico
Distancia maxima entre dois pontos
Distinct Range Query
Distinct Range Query com Update
Dominator Points
DP de Dominacao 3D
Gray Code
Half-plane intersection
Heap Sort
Hungaro
Inversion Count
LIS - recupera
LIS - tamanho
Minimum Enclosing Circle
Minkowski Sum
MO
MO - DSU
MO em Arvores
Palindromic Factorization
Parsing de Expressao
RMQ com Divide and Conquer
Segment Intersection
Sequencia de de Brujin
Shortest Addition Chain
Simple Polygon
Steiner Tree
Sweep Direction
Triangulacao de Delaunay
Triangulos em Grafos
notes
Strings
Aho-corasick
eertree
KMP
Manacher
Min/max suffix/cyclic shift
String Hashing
String Hashing - modulo 2^61 - 1
Suffix Array - O(n log n)
Suffix Array - O(n)
Suffix Array Dinamico
Suffix Automaton
Trie
Z
menu
search
Procurar
GitHub
Ativar o modo escuro
Ativar o modo de luz
para navegar
para escolher
para fechar
cancelar
Home
Grafos
LCA-HLD
On this page
Table of Contents
article
LCA-HLD
article
HLD - aresta
article
HLD - vertice
article
HLD sem Update
article
LCA com binary lifting
article
LCA com HLD
article
LCA com RMQ