3293: [Cqoi2011]分金币 (中位数)

#include<algorithm>
#include<iostream>
#include<cstdio>
#include<cmath>
#define inf 0x7fffffff
using namespace std;
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
int n,a[100001];
long long c[100001],ans,sum;
int main(){
	n=read();
	for(int i=1;i<=n;i++)
		a[i]=read(),sum+=a[i];
	sum/=n;
	for(int i=2;i<=n;i++)
		c[i]=c[i-1]+a[i-1]-sum;
	sort(c+1,c+n+1);
	int tmp=c[(n+1)/2];
	for(int i=1;i<=n;i++)
		ans+=abs(tmp-c[i]);
	printf("%lld",ans);
	return 0;
}