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 , or this but i can't understand how they solved it with segment tree. anyone can explain 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 | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 143 |
| 4 | AmShZ | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | maroonrk | 134 |
| 9 | BledDest | 132 |
| 10 | qwexd | 129 |
→ Find user
→ Recent actions
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
laughinggorrila | 2021-11-23 15:46:53 | 204 | ||
| en2 |
|
laughinggorrila | 2021-11-23 14:15:04 | 145 | ||
| en1 |
|
laughinggorrila | 2021-11-23 13:13:01 | 604 | Initial revision (published) |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/07/2026 09:07:10 (g2).
Desktop version, switch to mobile version.
Supported by
