Unable to solve the problem Editorial is also not available . Can anybody explain? Thanks in advance:)
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 19.05.2026 21:03:31 (g1).
Десктопная версия, переключиться на мобильную.
При поддержке
Store an array b where b[i] is the sum of all aj = i
So in the sample, b would be {2, 10, 6}, the problem turns into a simple DP problem, if you are at state i you have 2 options:
1) leave b[i] and move to state i + 1
2) take b[i] and move to state i + R + 1
Giving WA:(
It will be wrong for test case 1 2 1 2 1 3
Sorry missed one more thing, you should set R = min(L, R)
because if you start taking elements in increasing order, then the difference between every consecutive values should be at least R
and if you start taking elements in decreasing order, then the difference between every two consecutive values should be at least L
The optimal solution is to choose the order which gives the minimum difference between consecutive values which is min(L, R)
code
Thanks:) Got it.
hey mate can u explain why it should be min(l,r) and not max(l,r)?? update :-> i got it,still thanks!!
It can be done with this way as well: do DP twice..from index 0 and going to right with distance R and from index 1e5 with distance L, then pick the maximum of the two values obtained.