 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
这道题似乎不用线段树吧？小地图最多n（n<=100）块 用每个小地图的4边所在的直线作网格 将整个平面抛分成不大于（2n*2n<=40000）的网格， 每个格要么被探索过，要么没有 枚举枚格格，判断是否属于某张小地图 时间复杂度O(n^3) 在n<=100时是可以接受的。 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
