Problem Statement

Towers Transmission Redistribution Problem Description A row of communication towers stretches along a remote stretch of highway. Every tower currently manages a certain number of active transmitters. To rebalance load across the network, the control system can temporarily take a tower offline, which spreads that tower's transmitters out to its immediate neighbors. The engineering team wants to know, for each tower, the largest number of transmitters that could ever be concentrated there after an optimal sequence of such rebalancing operations. You need to work out, for every tower i, the maximum number of transmitters that can end up gathered at it after any sequence of these operations. Rules of Redistribution There are n towers in total, numbered 1 to n. Each tower i initially has a i active transmitters. When the control system takes a tower offline: Let x be the current number of transmitters at that tower. [x / 2] transmitters move to the previous tower (tower i-1), and another [