bzoj1045: [HAOI2008] 糖果传递

原型是环状的匀分纸牌，就是数学分析法。这类题目应该都是取中位数

const int N = 1000010;
int n, Dat[N];

inline void Input() {
	scanf("%d", &n);
	Rep(i, n) scanf("%d", &Dat[i]);
}

inline void Solve() {
	LL T = 0;
	Rep(i, n) T += Dat[i];
	T /= n;
	
	Dat[0] -= T;
    Rep(i, n - 1) Dat[i + 1] += Dat[i] - T;
    
    sort(Dat, Dat + n);
    T = 0;
    Rep(i, n) T += abs(Dat[n / 2] - Dat[i]);
    cout << T << endl;
}

int main() {
	Input();
	Solve();
	return 0;
}