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

好象一般的离散化就可以很快的过了,如果要用线段树的话可以对坐标进行排序编号,那样又会快很多,只是有点麻烦……

Posted by atlas_of_rruucc at 2004-07-16 17:20:39 on Problem 1151
In Reply To:哪位说说0MS怎么做出来,我涉险才过了的 Posted by:richardhuang at 2004-07-16 13:12:28
> rt

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