spoj Books1: partition array of size m into k continuous subset minimizing the maximum sum