P1031 [NOIP 2002 提高组] 均分纸牌 题解

turing_cyc · 2025-07-24 15:53:16 · 题解

include<bits/stdc++.h>

using namespace std;

int n,m[10005],x,y;

int main(){

cin>>n;

for(int i=1;i<=n;i++) cin>>m[i],x+=m[i];

x/=n; for(int i=1;i<=n;i++){

if(m[i]<x)  y++,m[i+1]-=x-m[i],m[i]=x;

if(m[i]>x)  y++,m[i+1]+=m[i]-x,m[i]=x;

}

cout<<y;

return 0;

}