P1031 [NOIP2002 提高组] 均分纸牌(贪心)

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000005;
const int INF = 0x3f3f3f3f;
#define reg register
#define IOS ios::sync_with_stdio(false)

int n;
int A[MAXN];

int main() {
	scanf("%d", &n);
	int sum = 0;
	for (int i = 1; i <= n; i++) {
		scanf("%d", A + i);
		sum += A[i];
	}
	sum /= n;
	for (int i = 1; i <= n; i++) {
		A[i] -= sum;
	}
	int ans = 0;
	for (int i = 1; i < n; i++) {
		if (A[i] == 0) {
			continue;
		}
		A[i + 1] = A[i] + A[i + 1];
		ans++;
	}
	printf("%d", ans);
	return 0;
}