i m doing this problem on spoj..i cant find any approach fr this..bt i feel this is to be done by sweep lines...hw to do this prob using sweep lines or by any other method??
Комментарии (4)
Написать комментарий
forest
|
18 месяцев назад,
#
|
Ответить
0
You can first compress coordinates and then use interval trees to determine if a poster is visible going from the last poster to the first one.
|
|
codeworrior
|
18 месяцев назад,
#
|
Ответить
0
can u explain a bit more abt what is coordinate compression??
|
SecrofedoC
|
13 месяцев назад,
#
|
Ответить
0
I think it's also possible with sorting and sweeping.
|
-
SecrofedoC13 месяцев назад, # ^ | Ответить
0
I solved with just STL set