UVA（11300）

#pragma warning(disable:4996)
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include<algorithm>
#include<iostream>
#include<time.h>
using namespace std;

long long a[1000005];
long long c[1000005];
const double INF = 0x3f3f3f3f;
int main()
{
    long long n;
    while (cin >> n)
    {
     long long sum = 0;
        for (int i = 1; i <= n; i++)
        {
            scanf("%lld",&a[i]);
            sum += a[i];
        }
        long long  M= (sum /n);
        c[0] = 0;
        for (int i = 1; i <n; i++)
        {
            c[i] = c[i - 1] + a[i]-M;
        }
        sort(c, c + n );
        long long x = c[ n / 2 ];
        long long ans = 0;
        for (int i = 0; i < n; i++)
        {
            ans += abs(x - c[i]);
        }
        printf("%lld\n", ans);
    }
    return 0;
}