Hey! Does anybody have a solution in n log n for this? Given n rectangles, determinate a point which is included by a maximum number of rectangles (including the boundaries).
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Hey! Does anybody have a solution in n log n for this? Given n rectangles, determinate a point which is included by a maximum number of rectangles (including the boundaries).
Name |
---|
It can be solved with sweep line algo and segment tree in $$$O(N \lg N)$$$.
I think that when sweeplining, for a certain x, you should perform all addition events for that x, then check for a new max, then all subtraction events for that x. Otherwise you might miss the correct answer if you perform a subtraction, then a query, then an addition.
Yes, I just give a rough idea. Those parts should be taken care when implementing.
It’s a very nice sketch. I just wanted to add the detail since I had also been thinking of the same solution for a little bit. I hope it helps the asker.
Yes, it helped me. Is this algorithm similar to that one: "find the number of intersections of segments, all segments parallel either Ox either Oy"? I think they are 90% the same, am I wrong?
You can think of each segment of length L as an 1xL or an Lx1 rectangle, so the rectangle problem is a generalization of the line segment problem.