← All problemsSign in

Radio Stations

There are $n$ initially inactive radio stations located on a line. Each radio station has a specific *coverage* $k$. This means that, when activated, it covers itself, and $k$ radio stations behind it, within its range. Activating a radio station costs $c$. You are given the task of getting all radio stations covered. Find the minimum cost required to achieve this goal. ###Input: - The first li

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start