Quantcast
Channel: 学步园 » nabobess
Viewing all articles
Browse latest Browse all 40

HDU – 5091(扫描线 + 线段树优化)

$
0
0
做法, 将读入的每个点(x,y)看做一个以该点为左上角宽W高H的矩形, 然后将矩形看做两条平行y轴(起点y-h […]

Viewing all articles
Browse latest Browse all 40

Latest Images

Trending Articles





Latest Images