糖果传递

#include<bits/stdc++.h>
#define re return
#define ll long long 
#define inc(i,l,r) for(int i=l;i<=r;++i)
using namespace std;
template<typename T>inline void rd(T&x)
{
    char c;bool f=0;
    while((c=getchar())<‘0‘||c>‘9‘)if(c==‘-‘)f=1;
    x=c^48;
    while((c=getchar())>=‘0‘&&c<=‘9‘)x=x*10+(c^48);
    if(f)x=-x;
} 

ll n,T,a[1000005],b[1000005]; 


int main()
{
    freopen("in.txt","r",stdin);
    
    ll average=0;
    rd(n);
    inc(i,1,n)
    {
        rd(a[i]);
        average+=a[i];
    }
    
    average/=n;
    
    inc(i,1,n)
    b[i]=b[i-1]+a[i]-average;
    
    sort(b+1,b+n+1);
    
    ll mid=b[(n+1)>>1],ans=0;
    
    
    inc(i,1,(n+1)>>1)
    ans+=mid-b[i];
    
    inc(i,((n+1)>>1)+1,n)
    ans+=b[i]-mid;
    
    printf("%lld",ans);
    re 0;
}