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

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
#define MAXN 1000100
typedef long long qword;
qword num[MAXN],f[MAXN];
int main()
{
        freopen("input.txt","r",stdin);
        int n;
        scanf("%d",&n);
        int i,j,k;
        qword sum=0;
        for (i=0;i<n;i++)
        {
                scanf("%lld",&num[i]);
                sum+=num[i];
        }
        int base=sum/n;
        int x,y,z;
        f[0]=num[i]-base;
        for (i=1;i<n;i++)
        {
                f[i]=f[i-1]+num[i]-base;
        }
        sort(f,&f[n]);
        int mid=(n-1)/2;
        qword ans=0;
        for (i=0;i<n;i++)
        {
                ans+=abs(f[i]-f[mid]);
        }
        printf("%lld",ans);
        return 0;
}