# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Name |
---|
Consider solving the problem independently for each color. We can do this by considering all of the positions that are marked by a certain color (the total number of positions is N across all colors).
It is always optimal to take a contiguous subarray of positions in the position array for a color. With the first sample input as an example, the positions array for color 1 would look something like {1, 3, 4, 7, 8}. If we wanted to take positions 1, 3, and 7, it would clearly be inoptimal to not take 4 as we are already deleting between 3 and 7.
English Comment
55403403