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
北京大学《ACM/ICPC大学生程序设计竞赛训练》暑期课面向全球招生!

TLE的童鞋可以看一下

Posted by NEU_20113292 at 2013-02-23 16:54:15 on Problem 3277
我是拿1151的代码过来的果断TLE了一直不明白怎么回事(我用的二分查找)
1151的代码思路是离散y坐标点然后从左到右扫描竖线段插入或者删除(线段树操作的)
自己写的数据大概跑1分钟
看了http://blog.sina.com.cn/s/blog_93ced90c01017eav.html
深受启发
简少了插入删除竖线段的时间代价是增加了查询未覆盖的时间
跟我一样TLE的可以看一看

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