| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 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 |
Good day everybody,
I've been going true some old problems and I've found this problem: 453B - Little Pony and Harmony Chest
And I've been wondering why can't I just cout [sum of (A0,A1,A2,...,AN) — N] and cout 1, N times ?
I'd be harmony sequence and it'd minimaze the sum.
I tryed subminting solution that did that but it failed.
Can someone explain why is this wrong?
because there might exists better solution — one with smaller sum of differences. Your goal is to minimize sum of |bi-ai|.
You have to minimize sum of absolute values, not an absolute value of sum.
Yea I see thanks, I didn't see that abs bracket.