- Recently I came across a new idea to solve graph related problems using segment trees, I would like to discuss the same with a problem.
Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
→ Find user
→ Recent actions
Segment tree for graph problems
Revision en1, by Ashwanth.K, 2024-11-01 07:58:37
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en10 |
|
Ashwanth.K | 2024-11-01 12:05:17 | 0 | (published) | |
| en9 |
|
Ashwanth.K | 2024-11-01 12:04:45 | 805 | Tiny change: 'ch of the M lines con' -> 'ch of the $M$ lines con' | |
| en8 |
|
Ashwanth.K | 2024-11-01 09:00:59 | 51 | Tiny change: 'ke: \n[Imgur](https://' -> 'ke: \n[ ](https://' | |
| en7 |
|
Ashwanth.K | 2024-11-01 08:44:57 | 96 | Tiny change: ' \n  |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/06/2026 22:19:37 (g2).
Desktop version, switch to mobile version.
Supported by
