Problem- link
Please anybody explain the soln.
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 149 |
6 | -is-this-fft- | 148 |
6 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | cry | 143 |
Problem- link
Please anybody explain the soln.
Name |
---|
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)).