BZOJ 1045 [HAOI2008] 糖果传递

//Twenty
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<vector>
#include<ctime>
typedef long long LL;
const int maxn=1e6+299;
using namespace std;
LL n,a[maxn],c[maxn],sum,ave,ans;
int main()
{
    scanf("%lld",&n);
    for(int i=1;i<=n;i++) {
        scanf("%lld",&a[i]);
        ave+=a[i];
    }
    ave/=n;
    for(int i=1;i<n;i++) {
        sum+=a[i];
        c[i]=sum-i*ave;
    }
    sort(c+1,c+n+1);
    int zw=c[n>>1];
    for(int i=1;i<=n;i++) {
        ans+=abs(c[i]-zw);
    }
    printf("%lld\n",ans);
    return 0;
}