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:树状数组好快……不过我先用虚二叉树AC了。O(logn*logn),3992K 1265MS G++ 1271B Posted by:faintzw at 2006-03-29 00:54:46 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator