The start of the search space is chosen as the max of all elements. Is it because if we do so, then the maximum amount of work that is done by remaining painters can be parallelized and that will result in the smallest possible total time?
Intition behind the search space in Painter's Problem
hello @amitqy
see someone have to paint block with maximum value. so the time taken by that painter will be max_value* time_to_paint_each_unit. we cannot minimize this time furthur because no two painters can paint same block.
that is the reason we are taking s=max_value*T
what is the reason that we are starting the search space with the guy that is taking the maximum value, why not with someone who takes lesser value? I mean ,there may be also someone who will paint block with least value, why are we not starting with him ?
but someone have to paint that large block also . and whoever will paint that will take atleast max_value * time .
so our answer will never be less than this max_value * time. (our task is to tell minimum time to paint all the blocks)
so if you want to find the ‘total time taken’ then that will at least be equal to the ‘maximum time taken’ by someone. It can’t go below than that, right ? That’s why we it as start of search space
yeah right … … … . 
Thanks man 
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.