Detail of message

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

Re:好象求rank时复杂度高了些啊

Posted by richardxx at 2006-12-27 22:53:08 on Problem 2828
In Reply To:好象求rank时复杂度高了些啊 Posted by:daringQQ at 2006-12-27 17:47:17

但是这和线段树的原理是一样的啊，我只是想编程简化点，不知道有没有办法在此基础上优化呢？

Followed by:

你这样不是log(n)的. (47) daringQQ 2006-12-27 22:57:10
- Re:你这样不是log(n)的. (40) richardxx 2006-12-28 20:19:55
  - 树状数组虽然方便,但是不如线段树灵活,可以用树状数组的地方都能用线段树,反之不然 (46) achilles 2006-12-28 20:21:47
    - Re:树状数组虽然方便,但是不如线段树灵活,可以用树状数组的地方都能用线段树,反之不然 (27) richardxx 2006-12-28 21:03:02
    - Re:线段树真是很灵活 (0) ecjtuxsyuan 2008-05-27 23:21:41

Post your reply here:

Home Page Go Back To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator