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 JiaJunpeng at 2014-05-10 23:33:57 on Problem 4027 and last updated at 2014-05-10 23:34:24 
对于每个x点，先存下最大的(某个参数比如) 50个点，然后构造线段树，当查询t1,t2,x1,x2时，先查询线段树看区间x1,x2中的50个点是否落在t1,t2，如果在就
返回最大值，不在的话随即撒(某个参数比如)比如400个t,更新最大值。。

算了一下，随即出数据的话这种算法出错率很小，几乎为0，但是如果刻意构造数据的话就不知道了。。。。不过貌似也不好造
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