Given n boards of lengths l_1, ..., l_n and a number k of painters, minimize the maximum time any single painter works if boards must be painted in order (each painter paints a contiguous segment).