| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3648 |
| 2 | Benq | 3580 |
| 3 | orzdevinwang | 3570 |
| 4 | cnnfls_csy | 3569 |
| 5 | Geothermal | 3568 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3530 |
| 8 | Radewoosh | 3520 |
| 9 | Um_nik | 3481 |
| 10 | jiangly | 3467 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | adamant | 164 |
| 2 | awoo | 164 |
| 4 | TheScrasse | 160 |
| 5 | nor | 159 |
| 6 | maroonrk | 156 |
| 7 | SecondThread | 150 |
| 8 | -is-this-fft- | 148 |
| 9 | pajenegod | 145 |
| 10 | BledDest | 144 |
Minimise the maximum difference between the heights
Given an array of integers H representing heights of towers and a positive integer K. It is allowed to either increase or decrease the height of every tower by B (only once).
How to calculate the minimum possible difference between the heights of the longest and the shortest tower after modifications.
Note: It is mandatory to either increase or decrease the height of every tower.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
Aafat_Wapas | 2019-08-01 19:12:58 | 2 | Tiny change: 'e integer K.\nIt is a' -> 'e integer B.\nIt is a' | |
| en2 |
|
Aafat_Wapas | 2019-08-01 12:32:10 | 4 | ||
| en1 |
|
Aafat_Wapas | 2019-08-01 12:30:57 | 454 | Initial revision (published) |
