This is the link of problem.I could not understand the editorial.Please help me out.
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3845 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3630 |
| 4 | orzdevinwang | 3573 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | jqdai0815 | 3532 |
| 8 | ecnerwala | 3501 |
| 9 | gyh20 | 3447 |
| 10 | Rebelz | 3409 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | adamant | 163 |
| 3 | awoo | 161 |
| 4 | nor | 152 |
| 5 | maroonrk | 151 |
| 5 | -is-this-fft- | 151 |
| 7 | TheScrasse | 148 |
| 8 | atcoder_official | 146 |
| 9 | Petr | 145 |
| 10 | pajenegod | 144 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 26.06.2024 14:57:57 (g1).
Десктопная версия, переключиться на мобильную.
При поддержке
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.