A31 贪心算法 P2512 [HAOI2008] 糖果传递

视频链接：81 贪心算法 [HAOI2008] 糖果传递_哔哩哔哩_bilibili

 

 

Luogu P2512 [HAOI2008] 糖果传递

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

const int N=1000005;
int n,a[N],c[N];
long long b,ans;

int main(){
  scanf("%d",&n);
  for(int i=1;i<=n;i++) 
    scanf("%d",&a[i]),b+=a[i];
  b=b/n;
  
  for(int i=2;i<=n;i++)
    c[i]=c[i-1]+a[i-1]-b;
  
  sort(c+1,c+1+n);
  
  for(int i=1;i<=n;i++)
    ans+=abs(c[i]-c[(n+1)/2]);
  printf("%lld\n",ans);
}