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.