Codevs 1098 均分纸牌 贪心

#include <iostream>
#include <cstdio>
#include <queue>
#include <cstring>
using namespace std;

const int MAXN = 1001;
int P[MAXN];

int main()
{
int n, aver = 0;

cin >> n;
for(int i = 1; i <= n; i ++)
scanf("%d", &P[i]);

for(int i = 1; i <= n; i ++)
aver += P[i];
aver /= n;

int cnt = 0;
for(int i = 1; i <= n; i ++)
{
if(P[i] < aver)
{
P[i+1] -= (aver-P[i]);
cnt ++;
}
else if(P[i] > aver)
{
P[i+1] += (P[i]-aver);
cnt ++;
}
}
cout << cnt << endl;
return 0;
}