Problem- link
Please anybody explain the soln.
Problem- link
Please anybody explain the soln.
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 | 173 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 160 |
| 5 | nor | 157 |
| 6 | maroonrk | 155 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 8 | orz | 146 |
| 10 | pajenegod | 145 |
see Ashishgup solution . dp cant be more neat than his solution
I saw but unable to understand this single line means why everyone is using suffix array even if we are processing from left to right :(
ans = max(dp(i + 1), a[i] + suf[i + 1] — dp(i + 1));
My logic was:
DP(i) stores the maximum value a particular player can get if he starts at the ith index and goes till the end of the array.
One possibility is, I retain my turn and skip the element, thus going to dp(i+1).
Other possibility is, I take the ith element (and get a score of a[i]) and lose my turn. If I lose my turn, then the score I get is:
sum of remaining elements — the maximum score that the other player can get if he starts at index i + 1.
That is, suf[i+1] — dp(i+1).
Hence the line: ans = max(dp(i + 1), a[i] + suf[i + 1] — dp(i + 1)).