Register
|
Login
HOME
PROBLEMSET
ROADMAP
COMPETITION
TOPIC
RANKING
GUIDE
MASHUP
ABOUT
CONTACT
Module Small-to-large
Small-to-large
**Frequency: 5/10** This technique enables merging data structures really fast.
Resources
- [USACO: Small-To-Large merging](https://usaco.guide/plat/merging?lang=cpp)
Problems
Distinct colors
132 / 148
1400
Picking apples
94 / 120
1700
Frequent color
71 / 93
1800
Path with length k 2
60 / 63
1800
LIS on tree
41 / 52
1900
Data structure
Sweep Line
Introduction to Trie
Square root decomposition
Tree
Rerooting
Small-to-large
Heavy-light decomposition
Graph
Strongly connect component
Articulation point and bridge
Bipartite Matching
Dynamic Programming
Digit DP
Matrix multiplication
Hashing
Hash a set
Others
Divide and conquer
Geometry
Geometry
Binary search
Parallel binary search
Others
Additional Problems (Level 5)