122.糖果传递

最新推荐文章于 2024-11-09 20:09:28 发布

_hys

最新推荐文章于 2024-11-09 20:09:28 发布

阅读量155

点赞数

分类专栏： CSA算法每日打卡

本文链接：https://blog.csdn.net/hys__handsome/article/details/124853368

版权

贪心算法糖果传递平均值数组操作动态规划优化

关键词由CSDN通过智能技术生成

CSA算法每日打卡专栏收录该内容

74 篇文章 1 订阅

订阅专栏

122.糖果传递
贪心

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

typedef long long LL;

const int N = 1000010;

int n;
int a[N];
LL c[N];

int main()
{
    scanf("%d", &n);
    for (int i = 1; i <= n; i ++ ) scanf("%d", &a[i]);

    LL sum = 0;
    for (int i = 1; i <= n; i ++ ) sum += a[i];

    LL avg = sum / n;
    for (int i = n; i > 1; i -- )
    {
        c[i] = c[i + 1] + avg - a[i];
    }
    c[1] = 0;

    sort(c + 1, c + n + 1);

    LL res = 0;
    for (int i = 1; i <= n; i ++ ) res += abs(c[i] - c[(n + 1) / 2]);

    printf("%lld\n", res);

    return 0;
}