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 |
题意给2个点集,问这2个点集能否各自够成简单多边形(不一定是凸多边形),要求所有的边(无伦是否属于同一多边形)都没有交叉。 暴力搜索效率低了点,但可以通过。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator