 |
| ||||
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 | |||||||||
倒，内存块没有用splay维护就过了……罪过啊……看来数据弱rt 这题如果要比较好的理论时间复杂度其实应该用两个平衡树，一个存储正在运行的进程，关键字是结束时间，一个存储空闲的内存单元段，关键字是单元的起始序号……这样可以做到O(nlgn)……但在是splay树上做二分查找会比较麻烦……如果要不麻烦就直接链表暴力存储空闲内存段吧%…… Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
