I have a problem, here is the link: 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 but i can't understand how they solved it with segment tree. Can anyone explain it to me?
Segment Tree is a divide and conquer based structure.
but the solution doesn't use segment tree and i want to solve this problem using segment tree. Can you help me?
Auto comment: topic has been updated by laughinggorrila (previous revision, new revision, compare).
Auto comment: topic has been updated by laughinggorrila (previous revision, new revision, compare).