Leetcode 3500. Minimum Cost to Divide Array Into Subarrays

链接：英文 | 中文

题目大意

给定两个等长数组 nums 和 cost，以及一个整数 k，你可以将 nums 分割成若干个非空 …

Update[220504]: 原来这种数据结构叫珂朵莉树啊，真神奇。。。

我们要解决什么问题

区间交问题，是我们在做题中经常遇到的问题。

例如，Insert …

Introduction

There are a lot of interview problem based on the 1D-array, which is the one of the easiest “data structure”.

But the problem about that simple data structure might not be that simple. Here is the summary of the problem about 1D-array.

Of course, most of them come from …