How to use segment tree?
Build tree and query
You can read this aritical to learn some basic operations of segment tree.
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
A brief introduction of Segment Tree(II):Update and "Lazy tag"
Revision en1, by RDFZzzx, 2022-08-02 02:56:20
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en6 |
|
RDFZzzx | 2022-08-02 06:29:52 | 1780 | Tiny change: 'nts.\n\n | |
| en5 |
|
RDFZzzx | 2022-08-02 05:13:24 | 60 | ||
| en4 |
|
RDFZzzx | 2022-08-02 05:10:23 | 443 | ||
| en3 |
|
RDFZzzx | 2022-08-02 04:03:38 | 318 | ||
| en2 |
|
RDFZzzx | 2022-08-02 03:00:48 | 274 | ||
| en1 |
|
RDFZzzx | 2022-08-02 02:56:20 | 313 | Initial revision (saved to drafts) |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/07/2026 06:01:48 (k1).
Desktop version, switch to mobile version.
Supported by
