| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 160 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 8 | awoo | 154 |
| 10 | luogu_official | 151 |
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) |
