How can a sequence of 'n' integers be partitioned into 'm' non-empty and contiguous partitions efficiently such that sum of maximums of all 'm' partitions is minimum (m<n)?