Help me solve problem E. Optimal Insertion
Difference between en2 and en3, changed 204 character(s)
I have a problem, here is the link: [https://codeforces.me/contest/1602/problem/E](https://codeforces.me/contest/1602/problem/E)↵
The Tutorial showed me a solution using divide and conquer. When i read some accepted code of this problem i realized that most people tend to solve this problem using some data structures like segment tree [like this](https://codeforces.me/contest/1602/submission/133014631) , [or this](https://codeforces.me/contest/1602/submission/133014296) but i can't understand how they solved it with segment tree.↵
I think [this](https://codeforces.me/contest/1602/submission/133014631) is the briefest code i've found, but i can't understand it296) but i can't understand how they solved it with segment tree.↵
Can anyone explain it to me?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English laughinggorrila 2021-11-23 15:46:53 204
en2 English laughinggorrila 2021-11-23 14:15:04 145
en1 English laughinggorrila 2021-11-23 13:13:01 604 Initial revision (published)