AcWing 122. 糖果传递

分析

代码

#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
#define LL long long
const int N=1000010;
LL c[N];
LL a[N];
int main(){
    int n;
    cin >> n;
    LL sum=0;
    for(int i=1;i<=n;i++){
        cin >> a[i];
        sum+=a[i];
    }
    LL avg=sum/n;
    for(int i=2;i<=n;i++){
        c[i]=c[i-1]-avg+a[i];
    }//ci =ci+1 +avg-ai;
    sort(c+1,c+n+1);
    LL res=0;
    for(int i=1;i<=n;i++){
        res+=abs(c[i]-c[(n+1)>>1]);
    }
    cout << res;
}