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 |
要求详细In Reply To:啥lca-rmq, 根本就是后序遍历+树型dp,O(n)复杂度,怪不得我的线段树超时! Posted by:wangfangbob at 2007-10-07 12:46:42 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator