Unable to solve the problem Editorial is also not available . Can anybody explain? Thanks in advance:)
Unable to solve the problem Editorial is also not available . Can anybody explain? Thanks in advance:)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 155 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 8 | orz | 146 |
| 10 | BledDest | 145 |
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.