This is the link of problem.I could not understand the editorial.Please help me out.
→ Обратите внимание
До соревнования
Refact.ai Match 1 (Codeforces Round 985)
4 дня
Зарегистрироваться »
Refact.ai Match 1 (Codeforces Round 985)
4 дня
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3831 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | ksun48 | 3373 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 05.11.2024 15:48:59 (h1).
Десктопная версия, переключиться на мобильную.
При поддержке
This is my submission — http://abc076.contest.atcoder.jp/submissions/1728533 . f(i) denotes the maximum speed we can have at the start of the ith interval. This speed should not be greater than v[i],v[i-1],f[i-1]+t[i],and
) . Now that you have the starting ( f(i) ) and ending speeds ( f(i+1) ) for each interval, calculate the maximum distance we can travel within that interval.
Is there a solution other than dp?
You can solve with math. You can see square1001 ’s comment below.
Hi, I'm the writer of this round — if you didn't understand my editorial, I'm sorry (maybe because of my bad English).
But, hope you can understand with seeing this diagram. The area of blue place represents the answer.