Divide & Conquer - DP

Authors: Andi Qu, Benjamin Qi

Using Divide & Conquer as a DP Optimization.

Allows you to reduce O(N2)O(N^2) to O(NlogN)O(N\log N).


Example - Circular Barn

Focus Problem – read through this problem before continuing!

You should already be familiar with the CHT solution.

This section is not complete.

Feel free to file a request to complete this using the "Contact Us" button.

Add analysis later.

Check the official editorial.


StatusSourceProblem NameDifficultyTagsSolution
CEOINormalView Solution
CFHardCheck CF
CFHardCheck CF
POIVery HardView Solution
IOIVery HardView Solution
PlatVery HardExternal Sol
JOIVery Hard

Module Progress:

Give Us Feedback on Divide & Conquer - DP!