Copy - data structure

Copy 1: tree

skill

1. LCA
2. Maintenance root point path information, DFS backtracking
3. Subtree information maintenance
4. Virtual Tree
5. Cartesian tree
6. Tree divide and conquer
7. Focus decomposition
8. DSU on tree

Copy of the Gou dogs

• U have to count how many points the root path weights less than u?
• U within the sub-tree statistics of how many points weights less than u?
• Statistics from every point of maximum distance, and distance.
• Statistics tree size is the number of the communication block k.
• Tree Tree based virtual DP +
• Tree cross + segment tree maintenance time function
• Gravity prefix and high dimensional exploded +
• Weighted disjoint-set
• Cartesian tree
• CF 293E Decomposition gravity + BIT

Copy 2: Maintenance Information section

skill

1. BIT
2. Segment tree
3. ST table
4. Segment tree can be persistent (permanent marker Thought)
5. Li Chao tree (permanent marker Thought)

Copy of the Gou dogs

• BIT rises up sequence requirements, decreased longest sequence, and the maximum increase in the longest sequence, and the longest maximum drop sequence.
• A segment tree maintenance function, operation: \ (X: = KX + B \) segment tree maintenance: maximum, minimum, the minimum number, the minimum position, and interval.
• 1_ tree line marks the merger
• 2_ tree line marks the merger
• Minimum maintenance interval segment tree number
• Large range of k
• Path k large query

Copy 3: Using monotonic

skill

1. Monotonous stack
2. Monotonous queue maintenance extremes
3. The slope optimization

Copy of the Gou dogs

• Seeking a less than a [x] element.
• Seeking a great all-sub-1 matrix.
• A plurality of vectors, multiple queries, each search a set of vectors and vector dot product max.
• Monotonous queue maintenance extremes
• Monotone queue optimization DP