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

UP

Posted by sunmoonstar_love at 2005-08-26 16:51:02 on Problem 2528
In Reply To:这个题纯线段树是nlogn么？我做线段树是递归实现的，速度比较慢，请问离散化怎么做？离散化之后是什么复杂度？ Posted by:sunmoonstar_love at 2005-08-26 16:01:40

Followed by:

排序然后离散化,我也是直接线段树,不离散化空间怎么够? (0) ArXoR 2005-08-26 17:50:06
- 7M购了 (0) sunmoonstar_love 2005-08-26 18:04:12
- 我排序以后离散华，空间够了，时间不够了。用递归做的。 (0) ildg 2006-07-25 19:36:07
  - 我是用数组进行动态分配的,访问的时候根据标记判断是否访问子结点 (0) sunmoonstar_love 2006-07-25 20:13:01
    - 我已经是黔驴技穷了，唉。。 (0) ildg 2006-07-27 12:16:10
    - Re:我是用数组进行动态分配的,访问的时候根据标记判断是否访问子结点 (31) Iambitious 2006-12-05 16:29:56
      - 直接离散化就够了 300多MS (35) alpc12 2007-06-24 13:17:59
        光是离散化会超时吧 (0) nuciedh 2007-06-27 23:38:15
        线段树＋离散化超时了　哪位帮忙看看　？ (2486) nuciedh 2007-06-28 09:00:59
        Re:线段树＋离散化超时了　哪位帮忙看看　？ (2745) initial 2007-09-07 19:11:51
        orz.... (0) hust07p43 2007-09-11 02:38:56

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