树剖大佬%%%
by 7KByte @ 2018-12-23 16:30:12
666可是没有必要吧
by YZhe @ 2018-12-23 17:22:43
不，我就是想试一下。顺便练一下zkw线段树
by z1431346079 @ 2018-12-24 12:55:45
已找出错误
```cpp
void build(int rt,int l,int r)
{
if(l==r)
{
tree[rt]=a[l];
return;
}
int mid=(l+r)>>1;
build(ls,l,mid);
build(rs,mid+1,r);
pushup(rt);
}
```
应改为
```cpp
void build(int rt,int l,int r)
{
if(l==r)
{
tree[rt]=a[past[l]];
return;
}
int mid=(l+r)>>1;
build(ls,l,mid);
build(rs,mid+1,r);
pushup(rt);
}
```
by z1431346079 @ 2018-12-24 13:27:40
封楼
by z1431346079 @ 2018-12-24 13:27:55