#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 1000010
inline char gc(){
static char buf[1<<16],*S,*T;
if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
return *S++;
}
inline int read(){
int x=0,f=1;char ch=gc();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
return x*f;
}
int n,a[N];ll s[N],sum=0,ans=0;
int main(){
// freopen("a.in","r",stdin);
n=read();for(int i=1;i<=n;++i) a[i]=read(),sum+=a[i];
sum/=n;for(int i=1;i<=n;++i) s[i]=s[i-1]+a[i]-sum;
nth_element(s+1,s+(n+1>>1),s+n+1);ll x=s[n+1>>1];
for(int i=1;i<=n;++i) ans+=abs(x-s[i]);
printf("%lld\n",ans);
return 0;
}
bzoj1045 [HAOI2008] 糖果传递(数学+贪心)
最新推荐文章于 2022-04-25 23:42:28 发布