Spreading the Wealth UVA - 11300

#include <iostream>
#include<stdio.h>
#include<algorithm>
#include<math.h>
using namespace std;
const int maxn=1e6+10;
typedef long long ll;
ll a[maxn],c[maxn];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        ll sum=0;
        for(int i=1; i<=n; i++)
        {
            scanf("%lld",&a[i]);
            sum+=a[i];
        }
        sum/=n;
        c[0]=0;
        for(int i=1; i<n; i++)
        {
            c[i]=c[i-1]+a[i]-sum;
        }
        sort(c,c+n);
        ll x1=c[n/2],ans=0;
        for(int i=0; i<n; i++)
        {
            ans+=abs(x1-c[i]);
        }
        printf("%lld\n",ans);
    }
    return 0;
}