Recently (two weeks ago) RuCode Festival 7.0 concluded.
Let's discuss the problems here.
How to solve A from DIVAB? I know how to solve most tasks, except A, C, F and L.
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 141 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 136 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/25/2026 13:29:36 (g2).
Desktop version, switch to mobile version.
Supported by
Auto comment: topic has been translated by induk_v_tsiane (original revision, translated revision, compare)
Please refrain from discussing the problems publicly until 10:00 (UTC) on this Sunday (October 29th), because this contest will be used as the next round of Universal Cup.
You can discuss the problems now. We will post an official editorial within a couple of days.
Editorial is here: https://tsweb.ru/trains/231015/231015-tutorial.en.pdf
There is a simpler solution to Shoes, without any Farach-Colton-Bender. We write the same dp, but then we notice that all diagonal requests are monotonic, and use the sliding window technique. Working code — https://pastebin.com/yADA7VhC.
Nice!!