Divide an Array Into Subarrays With Minimum Cost I
You are given an array of integers nums of length n.
The cost of an array is the value of its first element. For example, the cost of [1, 2, 3] is 1, while the cost of [3, 4, 1] is 3.
You need to divide nums into 3 disjoint contiguous subarrays.
Return the minimum possible sum of the cost of these subarrays.
Example 1
Input
nums = [1,2,3,12]Output
6The best possible way to form 3 subarrays is
[1], [2], and [3, 12], with total cost 1 + 2 + 3 = 6.Example 2
Input
nums = [5,4,3]Output
12The best possible way to form 3 subarrays is
[5], [4], and [3], with total cost 5 + 4 + 3 = 12.Constraints
- 3 <= n <= 50
- 1 <= nums[i] <= 50