3010. Divide an Array Into Subarrays With Minimum Cost I

Given nums, split it into exactly 3 contiguous non-empty subarrays; the cost = the sum of the first elements of the subarrays. The first subarray always starts at nums[0]. Minimize the cost. The…