题解
多余的数字每次都往左边分配,每次都分配剩余的再向右分配,向右分配不足的需要再从右边多余的数组分配过来,所以就搬动了2次
#include<bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 10;
int a[N];
int main(){
int n,sum = 0;
cin>>n;
for(int i = 0;i < n;i ++)cin>>a[i],sum += a[i];
int len = sum / n;
int now = 0;
int res = 0;
for(int i = 0;i < n;i ++){
if(a[i] < len){
res ++;
if(now > 0 && now - a[i] < 0)res ++;
now -= a[i];
}
else if(a[i] > len){
now += a[i];
}
else if(a[i] == len){
if(now != 0)res ++;
}
}
cout<<res<<endl;
return 0;
}