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

树状数组，一边读一边插，只开一个 int sum[MAXN/32+1],只要250K就够了

Posted by sempr at 2006-10-21 21:10:24
In Reply To:您一个都没开么？我确实只开了一个，结果MLE Posted by:forgotten at 2006-10-21 15:42:06

Followed by:

树状数组不是c[MAXNUM] 吗? 怎么会除32? 请Sempr大牛赐教 (1) ziliang 2006-10-22 18:28:18
- even (5) cheapwine 2006-10-22 18:33:02
- odd (5) cheapwine 2006-10-22 18:33:08
怎么插的呢。。不会，Sempr能具体讲讲吗？比赛时候没做出来。。 (0) Acsaga 2006-10-22 18:33:06
- 恩不会. (0) lxjac 2006-10-22 18:39:20
  - 0/1 bitfield even/odd (0) cheapwine 2006-10-22 18:49:16
    - 能讲详细点吗 (0) lxjac 2006-10-22 19:25:39
      - 假设整数用1个二进制位表示溢出不算：） (0) cheapwine 2006-10-22 20:14:23

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