Given an array/list of length ‘N’, where the array/list represents the boards and each element of the given array/list represents the length of each board. Some ‘K’ numbers of painters are available to paint these boards. Consider that each unit of a board takes 1 unit of time to paint.
Given an array/list of length ‘N’, where the array/list represents the boards and each element of the given array/list represents the length of each board. Some ‘K’ numbers of painters are available to paint these boards. Consider that each unit of a board takes 1 unit of time to paint. You are supposed to return the area of the minimum time to get this job done of painting all the ‘N’ boards under a constraint that any painter will only paint the continuous sections of boards. For Example : In the below figure where array/list elements are {2, 1, 5, 6, 2, 3}. A painter can paint blocks {5,6} or {1,5,6,2} together but not {2,5,6} or {5,6,3}. Input Format : The first line contains a single integer ‘T’ denoting the number of test cases. The first line of each test case contains two integers ‘N’ and ‘K’ denoting the number of elements in the array/list and number of painters available. The second line contains ‘N’ single space-separated integers denoting the elements of the array/...