One of the question is

Divide array in subsequence with sum no greater than m and also minimize the sum of maximum value from each subarray.

Does anyone have idea on solving this problem maybe with time complexity less than n^2?