function solution(N, A) {
    let length = A.length;
    let arr = new Array(N).fill(0);
    let max = 0;
    let standard = 0;
    for(let i = 0; i < length; i++){
        standard = Math.max(...arr);
        if(A[i] <= N){
          ++arr[A[i]-1];
        }
        if(A[i] === N + 1){
            arr.fill(standard);
            continue;
        }
    }
    return arr;
}