| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 5 | Um_nik | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 134 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
Having trouble in solving segment tree problem.
Hi everyone!
I have just participated in an IT contest in my city recently. And there was a segment tree problem that for now, I cant think of the way to use the segment tree properly. Heres the problem:
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en7 |
|
NotHandsomeBoizz | 2025-05-29 17:50:54 | 0 | (published) | |
| en6 |
|
NotHandsomeBoizz | 2024-01-14 04:48:05 | 6 | Tiny change: 'r x, y (l >= x >= y >= r) such ' -> 'r x, y (l <= x <= y <= r) such ' (saved to drafts) | |
| en5 |
|
NotHandsomeBoizz | 2024-01-12 16:40:13 | 0 | (published) | |
| en4 |
|
NotHandsomeBoizz | 2024-01-12 16:39:20 | 20 | Tiny change: 'ntegers a1, a2, a3, ' -> 'ntegers a1\n-, a2, a3, ' | |
| en3 |
|
NotHandsomeBoizz | 2024-01-12 16:37:26 | 391 | ||
| en2 |
|
NotHandsomeBoizz | 2024-01-12 16:23:39 | 796 | Tiny change: 'nt -1.\n\n\n`hello`\n' -> 'nt -1.\n\n* Example:\n' | |
| en1 |
|
NotHandsomeBoizz | 2024-01-11 19:13:40 | 349 | Initial revision (saved to drafts) |
