Problem Statement

Towers Transmission Redistribution Problem Description A line of communication towers is placed along a deserted Highway. Each tower maintains a group of active transmitters. When the central system wants to rebalance network load, it can temporarily disable a tower – redistributing its transmitters to neighboring towers. The engineers want to predict, for every tower, what is the maximum number of transmitters that could be gathered around it after performing these redistributions optimally. You must determine, for every tower i, the maximum possible number of transmitters that could be accumulated around it after performing any sequence of redistributions. Rules of Redistribution There are n towers in total, numbered 1 to n. Each tower i initially has a i active transmitters. When the central system disables a tower: Let x be the current number of transmitters at that tower. [x / 2] transmitters move to the previous tower (tower i-1), and another [x / 2] move to the next tower (tower