Freaks City

This problem involves computing the minimal cost to merge points into a connected component using a divide-and-conquer DP approach. Key Insights The recurrence relation stems from optimal substructure: For even counts: The optimal strategy splits the points into two equal halves For odd counts: The optimal strategy splits into nearly equal hal ...