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 |
Treap写垃圾了,TLE了无数次,只好交线段树了……线段树真不愧是高度平衡二叉树,速度比我写的Treap强多了。还好这次数组没开小。 const int maxn = 250005; const int maxnode = 800005; ………… Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator