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.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
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.
Название |
---|
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!!