显示代码纯文本
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;
const int maxn=120;
int n;
int a[maxn];
int c[maxn];
int main()
{
freopen("overload.in","r",stdin);
freopen("overload.out","w",stdout);
scanf("%d",&n);
int tot=0;
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
tot+=a[i];
}
c[0]=0;
int m=tot/n;
for(int i=1;i<n;i++)
{
c[i]=c[i-1]+a[i]-m;
}
sort(c,c+n);
int x1=c[n/2];
int ans=0;
for(int i=0;i<n;i++)
{
ans+=abs(c[i]-x1);
}
printf("%d\n",ans);
return 0;
}