Can someone please provide any hint on how to solve this question? I am trying to learn dp, If someone could spare some time it would be great.
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 153 |
| 2 | nik_exists | 151 |
| 3 | maroonrk | 150 |
| 4 | maspy | 149 |
| 5 | AmShZ | 146 |
| 6 | Um_nik | 143 |
| 7 | Errichto | 139 |
| 8 | adamant | 135 |
| 9 | BledDest | 134 |
| 10 | cry | 130 |
Can someone please provide any hint on how to solve this question? I am trying to learn dp, If someone could spare some time it would be great.
| Название |
|---|



We can solve it without dp too in O(N^2) using contribution to total sum trick, consider an arbitary subarray [l,r] assume this is a single segment and there are separators between Ar & Ar+1 , Al-1, Al , so now we have k-3 separators left to place in left segment and right segment and multiply this product by avaliable gaps in both left and right combined let this number be g , ans+=product*gCk-3 do this for all subarrays and u get the answer.