《战略忽悠局 外传》超大飞翔天宇原创 (转载)# Joke - 肚皮舞运动
a*m
1 楼
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}.
know it could be solved by DP. But solution space seems quite big. What is
the optimal solution? Thx.
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}.
know it could be solved by DP. But solution space seems quite big. What is
the optimal solution? Thx.