i think this problem can be solved by binary search
correct me if i m wrong
On Mon, Apr 4, 2011 at 2:36 PM, rajat ahuja <catch.rajatah...@gmail.com> wrote:
> You have to paint N boards of length {B1, B2, B3… BN}. There are K painters
> available and you are also given how much time a painter takes to paint 1
> unit of board. You have to get this job done as soon as possible under the
> constraints that any painter will only paint continuous sections of board,
> say board {2, 3, 4} or only board {1} or nothing but not board {2, 4, 5}.
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
