3013. Divide an Array Into Subarrays With Minimum Cost II

Given nums, numbers k and dist. Split the array into exactly k contiguous subarrays; cost = the sum of the subarrays' first elements. The first subarray starts at nums[0]. Additionally, the indices…