코딜리티MINMAXDIVISION1 [CODILITY] MINMAXDIVISION 문제 You are given integers K, M and a non-empty array A consisting of N integers. Every element of the array is not greater than M. You should divide this array into K blocks of consecutive elements. The size of the block is any integer between 0 and N. Every element of the array should belong to some block. The sum of the block from X to Y equals A[X] + A[X + 1] + ... + A[Y]. The sum of empty bl.. 2020. 4. 1. 이전 1 다음