题目:http://www.lydsy.com/JudgeOnline/problem.php?id=1045
训练指南第四页例题(分金币)
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string.h>
#include <queue>
#include <vector>
#include <algorithm>
#include <cassert>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define rrep(i,a,b) for(int i=(a);i>=(b);--i)
#define clr(a,x) memset(a,(x),sizeof(a));
#define eps 1e-8
#define LL long long
#define mp make_pair
const int inf=1e8;
const int maxn=1000000+5;
//xi: i给i-1的糖果数 M:平均糖果数 Ai:初始糖果数
/*
Ci = (A1+A2+...+A(i-1))-(i-1)*M;
A1-x1+x2=M -> x2 = x1-C1
A2-x2+x3=M -> x3 = M-A2+x2 = 2*M-A2-A1+x1 = x1-C2
A3-x3+x4=M -> x4 = M-A3+x3 = 3*M-A1-A2-A3+x1 = x1-C3
........ -> xi = x1-C(i-1)
An-Xn+x1=M
z=minimize( |x1|+|x2|+|x3|+....+|xn|=|x1|+|x1-C2|+....+|x1-C(n-1)|
*/
LL C[maxn],a[maxn];
int main()
{
int n;
while(scanf("%d",&n)==1) {
LL M=0;
rep(i,1,n+1) { scanf("%lld",a+i); M+=a[i]; }
M /= n;
C[0]=0; C[1]=0;
rep(i,2,n+1) C[i]=C[i-1]+a[i-1]-M;
sort(C+1,C+n+1);
LL mid=C[n/2+1],ans=0;
rep(i,1,n+1) ans += abs(mid-C[i]);
printf("%lld\n",ans);
}
}