 |
| ||||
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 | |||||||||
推荐一道题:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=&problem=3149&mosmsg=Submission+received+with+ID+13907762 块状链表实现树链剖分,貌似 各种log(n)数据结构都无法实现这道题(因为要求必须是在线询问)。。。，复杂度 (m+n)*sqrt(n)*log(n) PS: 代码实现太变态了，500多行啊！！！ 貌似zhouerjin神犇写过这道题目的论文。。。。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
