一只log吧
by Mr_Spade @ 2018-12-12 18:15:33
确定？？
by xhhkwy @ 2018-12-12 18:18:20
怎么搞...我认为是$N^2$的啊
by xhhkwy @ 2018-12-12 18:18:35
不是Fenwick里面保存$[i - lowbit(i) + 1 , i]$构成的权值线段树
by xhhkwy @ 2018-12-12 18:19:34
那为什么不对啊
by Mr_Spade @ 2018-12-12 18:23:44
@[Mr_Spade](/space/show?uid=7253) 一共有$N$个`Segment-Tree`，每个都是O(N)的空间啊
by xhhkwy @ 2018-12-12 18:25:59
2隻log
by Effulgent @ 2018-12-12 18:33:15
@[xhhkwy](/space/show?uid=96592) 并没有$O(n)$空间啊 都是不满的 总数可以分析出来不会太多
by Mr_Spade @ 2018-12-12 18:37:05
@[Mr_Spade](/space/show?uid=7253) 是我弱了...但是上面的那个两个log是对的吗
by xhhkwy @ 2018-12-12 18:41:43
@[xhhkwy](/space/show?uid=96592) 每次修改$O(log^2n)$
by ddwqwq @ 2018-12-12 18:46:36