hardArrayDynamic ProgrammingPrefix Sum 0 views
Minimum Cost to Divide Array Into Subarrays
You are given two integer arrays, nums and cost, of the same size, and an integer k.
You are given two integer arrays, nums and cost, of the same size, and an integer k.
You can divide nums into subarrays. The cost of the ith subarray consisting of elements nums[l..r] is:
Note that i represents the order of the subarray: 1 for the first subarray, 2 for the second, and so on.
Return the minimum total cost possible from any valid division.
Example 1
Input: nums = [3,1,4], cost = [4,6,6], k = 1
Output: 110
Example 2
Input: nums = [4,8,5,1,14,2,2,12,1], cost = [7,2,8,4,2,2,1,1,2], k = 7
Output: 985
Constraints
- 1 <= nums.length <= 1000
- cost.length == nums.length
- 1 <= nums[i], cost[i] <= 1000
- 1 <= k <= 1000
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.