UVA11300 - Spreading the Wealth

#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <iostream>
using namespace std;
long long a[1000010];
long long c[1000010];
int main() {
	int n;
	while (scanf("%d", &n) != EOF) {
		long long num = 0;
		for (int i = 1; i <= n; ++ i) {
			scanf("%lld", &a[i]);
			num += a[i];
		}
		num /= n;
		c[0] = 0;
		for (int i = 1; i < n; ++ i) {
			c[i] = c[i - 1] + a[i] - num;
		}
		sort(c, c + n);
		long long x = c[n / 2], ans = 0;
		for (int i = 0; i < n; ++ i) {
			ans += abs(x - c[i]);
		}
		printf("%lld\n", ans);
	}
}