There are N points and M segments, the ith point is located at p[i] and the ith segment's size is s[i]. What is the maximum number of points that can be covered by these segments?
My current solution is O(N * 2^M). Is there any better solution?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 163 |
3 | awoo | 161 |
4 | nor | 152 |
5 | maroonrk | 151 |
5 | -is-this-fft- | 151 |
7 | TheScrasse | 148 |
8 | atcoder_official | 146 |
9 | Petr | 145 |
10 | pajenegod | 144 |
maximum points covered by segments
There are N points and M segments, the ith point is located at p[i] and the ith segment's size is s[i]. What is the maximum number of points that can be covered by these segments?
My current solution is O(N * 2^M). Is there any better solution?
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en3 | start_over | 2024-05-04 08:06:45 | 4 | Tiny change: ' O(N * 2^M). Is the' -> ' O(N * 2^M * M). Is the' | ||
en2 | start_over | 2024-05-04 07:46:41 | 7 | Tiny change: ' O(N * 2^M * logN). Is ther' -> ' O(N * 2^M). Is ther' | ||
en1 | start_over | 2024-05-04 07:22:40 | 294 | Initial revision (published) |
Название |
---|