题解：https://www.luogu.org/blog/LittleRewriter/solution-p2512
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
int n;ll c;
ll a[],b[];
ll abs1(ll x){return x>=?x:-x;}
ll an;
int main()
{
int i;ll t;
while(scanf("%d",&n)==)
{
c=;an=;
for(i=;i<=n;++i)
{
scanf("%lld",&a[i]);
c+=a[i];
}
c/=n;
for(i=;i<=n;++i)
{
a[i]-=c;
b[i]=b[i-]+a[i];
}
int p=(n+)/;
nth_element(b+,b+p,b+n+);t=b[p];
for(i=;i<=n;++i)
an+=abs1(t-b[i]);
printf("%lld\n",an);
}
return ;
}