糖果传递(贪心算法c++实现)

#include<iostream>
#include<algorithm>
using namespace std;
const int N = 1000010;
int n;
int q[N];
long long c[N];

int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%d",&q[i]);
    
    long long sum = 0;
    for(int i=1;i<=n;i++) sum += q[i];
    long long avg = sum/n;
    
    for(int i=n;i>1;i--) c[i]=c[i+1] + avg - q[i];
    
    c[1]=0;
    
    sort(c+1,c+n+1);
    
    long long res= 0;
    
    for(int i=1;i<=n;i++) res += abs(c[i] - c[(n+1)/2]);
    
    printf("%lld",res);
    
}