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

同TLE....线段树做的rmq...

Posted by frkstyc at 2007-10-06 21:54:30 on Problem 3419
In Reply To:我严格的O(NlogN)TLE了，同学的O(N^2)过了，郁闷！ Posted by:tjuwizard at 2007-10-06 21:05:11

Followed by:

建议把时限扩到你的code能过那样……好像今天不少线段树被卡了…… (0) MrRight 2007-10-06 21:56:33
我想喊…… (7) frkstyc 2007-10-06 22:17:32
- 你不是admin咩？改一下时限让自己的过了呀 (11) cuiaoxiang 2007-10-06 22:19:26
- 今天月赛冠军没改名字！不给发奖金 (11) nuciedh 2007-10-06 22:26:20
  - 只能说这位大牛够低调 (0) Thank_you 2007-10-06 22:35:56
    - 我猜是楼教主！ (0) nuciedh 2007-10-06 22:39:06
您也知道了吧？我也要大声喊…… (9) bug27 2007-10-06 22:21:15
- sigh....... (13) frkstyc 2007-10-06 22:35:56
  - 认识到了……sparse table ms要比segment tree快…… (0) frkstyc 2007-10-06 22:49:06
    - 快是快但还真是第一次见到卡这个的。。。。。 (0) zhougelin 2007-10-06 23:16:17
      - 如同上次你让twb郁闷一样…… (0) frkstyc 2007-10-06 23:18:22
        这还是有数量上的差别的 (28) zhougelin 2007-10-06 23:20:56
- 自己RP烂……nlogn能过已经放宽了好不…… (13) rovingcloud 2007-10-06 23:06:50
  - 汗,我nlogn的winner tree怎么过了@_@ (0) lunatic 2007-10-07 11:35:54
同学，静态rmq用st呀，线段树那个常数大的…… (0) fishpear 2011-09-03 09:25:29

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