bzoj 1045 [HAOI2008] 糖果传递 —— 贪心

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
int const maxn=1e6+5;
int n,a[maxn],ave,c[maxn];
ll ans;
int abb(int x){return (x>0)?x:-x;}
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)scanf("%d",&a[i]),ans+=a[i];
    ave=ans/n; ans=0;
    for(int i=1;i<=n;i++)c[i]=c[i-1]+a[i]-ave;
    sort(c+1,c+n+1);
    int mid=c[n/2+1];
    for(int i=1;i<=n;i++)ans+=abb(c[i]-mid);
    printf("%lld\n",ans);
    return 0;
}