Cp_ideas
General solving ideas
- Brute it till the end (Three towers)
- Work it with standards and optimize till the end (Globetrotter Congress)
- k-Base numbers Find Maximum
- Find a lowerbound for the answer (APIO 2016 gap)
- Proof by contradiction:
- Find a function then solve for cases:
- String representation as a graph for adjecency (Two small strings)
- Work the math (Zero Quantity Maximization)
- For some L, pick the maximum R and continue (Minimal Segment cover)
- Transform 2d grid to 2 trees (IOI 2012 - City)
- Greedy Knapsack-like (IOI 2013 - Robots)
- Optimize the constraints using Pigeonhole (Modulo Sum)
DP ideas
- Inclusion Execlusion? (Natlan Exploring)
- Grids:
- +1 -1 is always between minimum and maximum (Shawarma)
- Maximum two paths, interesction doesn't count
- Count ways if a cell blocked is a prefix suffix from digonals
Combinatorics
Data structures
-
Fix an R and solve for all L's: