SW练习_ P1031 均分纸牌_DP

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
    public static void main(String[] args) throws Exception{
        BufferedReader reader=new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st=new StringTokenizer(reader.readLine());
        int N=Integer.parseInt(st.nextToken());//牌的堆数 N<=100
        st=new StringTokenizer(reader.readLine());//每堆最多10000张牌
        int[] arr=new int[N+1];
        int[] arrc=new int[N+1];
        int sum=0;
        for (int i = 1; i <=N ; i++) {
            arr[i]=Integer.parseInt(st.nextToken());
            sum=sum+arr[i];
        }
        int ave=sum/N;//题目上说了，可以整除
        for (int i = 1; i <=N ; i++) {
            arrc[i]=arr[i]-ave;
        }
        int count=0;//移动的次数
        int diff=0;

        for (int i = 0; i <=N ; i++) {
            diff=diff+arrc[i];
            if(diff!=0){
                count++;
            }
        }
        System.out.println(count);

        reader.close();
    }
}