 |
| ||||
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 | |||||||||
我的解法先转换成k个矩形，再尝试每个矩形的右边界和下边界是否穿过其他矩形，一个都不穿过的话就记录该线，最后判断一下是否有两个矩形在 由所有记录的线组成的表格 的同一个单元格中，有的话就NO，没有就YES。总时间复杂度为O(k^2) Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
