UVA11300 Spreading the Wealth

知识点：环形均分纸牌问题

环形均分纸牌 = 均分纸牌 + 货仓选址，就是这么回事，李煜东的书把求环形均分纸牌问题讲的很清楚，但是难的不是做出来这道题，而是以后遇见没见过的题能像这道题一样分析思路，

#include <bits/stdc++.h>

using namespace std;

typedef unsigned long long ull;

const int N = 1e6 + 5;

long long a[N], b[N];

int main() {
	int n;
	while (cin >> n) {
		long long sum = 0;
		for (int i = 1; i <= n; i++) {
			cin >> a[i];
			sum += a[i];
		}
		for (int i = 1; i <= n; i++) {
			b[i] = b[i - 1] + a[i] - sum / n;
		}
		sort(b + 1, b + n + 1);
		int ind = (n + 1) / 2;
		ull ans = 0;
		for (int i = 1; i <= n; i++) {
			ans += (ull) abs(b[ind] - b[i]);
		}
		cout << ans << endl;
	}
	return 0;
}