| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
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) |
