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 * M). Is there any better solution?
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | djm03178 | 152 |
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 * 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 |
---|