题目大意我就不多说了(数学,我永远的痛 )…思路直接看下面那两张图吧,至于图为什么是倒的咱也不知道…(请无视我的通篇错字…还有好好的t[i]后来就变成了c[i])
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<cmath>
using namespace std;
const int maxn=1e6+10;
#define ll long long
int n;
ll a[maxn],c[maxn],m;
int main(){
while(~scanf("%d",&n)){
ll sum=0;
for(int i=1;i<=n;i++){
scanf("%lld",&a[i]);
sum+=a[i];
}
ll m=sum/n;
c[0]=0;
for(int i=1;i<=n;i++){
c[i]=c[i-1]+a[i]-m;
}
sort(c+1,c+1+n);
ll init=n/2,ans=0;
for(int i=1;i<=n;i++)
ans+=abs(c[init]-c[i]);
cout<<ans<<endl;
}
return 0;
}