Painter's Partition Problem

#1

can you explain this question i am unable to understand this question

#2

where is the problem in my code

#3

some of the test case not pass

#4

@Amre-8800
or understanding why u need to have that start as max of array

question urself
if u have array of 3
and 3 painter
then what will be the minimum time required to paint all the boards
given this condition
A board can only be painted by 1 painter at maximum.
so given the array 4 6 8
max time is 8 units
even if the first painter finishes his task first
the entire board hasnt been painted
minimum till will be min ( 4, 6 , 8)
so this implies that the answer would haave minimum value as max element of array

in caseno of painter increase even then min should start from max element of array

i hope u`ll understand what i am trying to tell u

#5

yaa sure thanks for helping me

#6

@Amre-8800
please mark this doubt as resolved in my doubt section and rate me as well.