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

这个预处理怎么做？能 n 么

Posted by sunmoonstar_love at 2005-08-17 19:33:50 on Problem 2559
In Reply To:为什么要维护队列? 不是只要预处理最近的比当前点低的左右两边的点的位置? Posted by:cscjzz at 2005-08-14 10:42:16

Followed by:

贴代码，您自己看 (1476) zhougelin 2005-08-17 19:36:51
- .........................pascal,等于不用看了 (1598) frkstyc 2005-08-17 19:37:34
  - 也许各校CS应该开设pascal的课程 (0) sothink 2005-08-17 19:38:51
    - 我们学过，哈哈 (0) sunmoonstar_love 2005-08-17 19:39:15
    - RC都没有pascal了…… (0) frkstyc 2005-08-17 19:39:50
    - 或者NOIP把pascal和basic一并抛弃...统一到C... 就完美了... (0) sothink 2005-08-17 19:39:55
      - basic已经挂了……pascal，这个……其实不把它那些特有的东西放大纲就还是ok的 (0) frkstyc 2005-08-17 19:42:01
  - 我的OI母语又被您鄙视了 (0) zhougelin 2005-08-17 19:39:49
    - 140ms？ == O(n)? (0) sunmoonstar_love 2005-08-17 19:40:49
      - 拜托，我是pascal.... (0) zhougelin 2005-08-17 19:49:33
    - 什么话嘛……能使就行，问题我不习惯…… (0) frkstyc 2005-08-17 19:40:58
不用预处理...一个栈就行了的 (0) ArXoR 2005-08-17 19:49:53

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