 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| 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 | |||||||||
这道题不用离散化哦矩形的数量上限与最大区间上限差不多，负数线段树也支持，终于不用离散化了，线段树横向一次纵向一次A了。 本身就是为了学线段树，昨天做1151，又离散化又扫描线，WA了一天还是放弃了，还是简单的题舒坦呀。。。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
