| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3803 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3627 |
| 4 | ecnerwala | 3584 |
| 5 | orzdevinwang | 3573 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | Radewoosh | 3542 |
| 9 | jqdai0815 | 3532 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 164 |
| 2 | awoo | 163 |
| 3 | adamant | 162 |
| 4 | maroonrk | 152 |
| 5 | -is-this-fft- | 151 |
| 6 | nor | 150 |
| 7 | atcoder_official | 147 |
| 8 | TheScrasse | 146 |
| 9 | Petr | 145 |
| 10 | SecondThread | 142 |
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.