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 |
O(n)的算法复杂就是从头到尾枚举每个点找出影响视野的点 若与此点(山坡点)连接的两条线段的端点在人所站的点与此点连接的直线的两侧 则此点影响视野 计算出此视野线与后面的哪条山坡线段相交就可以了 并且被遮挡的山坡的点不会再次遮挡视野 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator