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?
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3390 |
| 6 | Um_nik | 3387 |
| 7 | tourist | 3384 |
| 8 | heuristica | 3322 |
| 9 | turmax | 3319 |
| 10 | jiangbowen | 3291 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 5 | Um_nik | 142 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | maroonrk | 133 |
| 9 | BledDest | 132 |
| 10 | qwexd | 129 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/07/2026 07:38:55 (f1).
Desktop version, switch to mobile version.
Supported by
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).