# 02.02.2026 [3013. Divide an Array Into Subarrays With Minimum Cost II] скачать в хорошем качестве

# 02.02.2026 [3013. Divide an Array Into Subarrays With Minimum Cost II]

02.02.2026 [3013. Divide an Array Into Subarrays With Minimum Cost II](https://leetcode.com/problems/divide-...) hard [blog post](https://leetcode.com/problems/divide-...) [substack](https://open.substack.com/pub/dmitrii...) [youtube](   • # 02.02.2026 [3013. Divide an Array Into S...  )  #### Join me on Telegram https://t.me/leetcode_daily_unstoppab... #### Problem TLDR Min sum of k splits at max d distance #hard #sliding_window #heap #### Intuition Didn't solve. ```j // take first // select k-1 min-sum values at dist // // *********** // * * // // move (k-1) pointers? // // binarysearch? // // binarysearch+dp? dp answers for sum: canSplit[i] // still should be minSplit[i] O(n^2) // no other ideas, lets try dp, inner cycle is d, O(nkd) // obviously deadend tle // somehow stuck with brute-force dp // looks like i didn't understood the description // dist is not between splits // it is between second and last // // let's go to hints // // sliding window + heap + heap // // *|**m*|******* // i-d i // // let's give up at 50 minutes ``` 1. Maintain sliding window of d 2. Put k-1 best values in one sorted container (TreeSet of n[i],i) 3. Remove overflows and d+1-distant values. 4. Keep still-in-window values in a second storage container 5. Balance when d+1-distant value has been removed #### Approach there is also a BIT solution (ask ai): sort distinct values, keep BIT-arrays of counts and sums #### Complexity Time complexity: $$O(nlogn)$$ Space complexity: $$O(n)$$ #### Code https://dmitrysamoylenko.com/2023/07/...