Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

O(n)的算法复杂

Posted by NEU_20113292 at 2013-03-05 19:00:29 on Problem 3227
就是从头到尾枚举每个点找出影响视野的点
若与此点(山坡点)连接的两条线段的端点在人所站的点与此点连接的直线的两侧
则此点影响视野 计算出此视野线与后面的哪条山坡线段相交就可以了
并且被遮挡的山坡的点不会再次遮挡视野

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator