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?
# | User | Rating |
---|---|---|
1 | tourist | 3757 |
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 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 165 |
3 | adamant | 164 |
4 | TheScrasse | 159 |
5 | maroonrk | 155 |
6 | nor | 154 |
7 | -is-this-fft- | 152 |
8 | Petr | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
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) |
Name |
---|