№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
Название |
---|
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