POI 1998 窗户 Window

POI No Comments »104 views

求连通块,由于数据范围过大,需要离散化,把10000压缩成2500。然后在指定区域内求出连通块的个数,BFS会有一点超时,需要用并查集优化。

Read the rest of this entry »

标签:, , ,
22 queries. 0.437 seconds. Designed by NattyWP .
Images by desEXign.