@[liuyufeng1](/user/368515) query里面写错了
```cpp
node query(int i, int x, int y){
int l = tree[i].l, r = tree[i].r;
if(x <= l && r <= y) return tree[i];
push_down(i);
int mid = l + r >> 1;
if(mid >= y) return query(i * 2, x, y);
if(mid < x) return query(i * 2 + 1, x, y);
node L = query(i * 2, x, y), R = query(i * 2 + 1, x, y), res;
res.sum = L.sum + R.sum;
res.mx = max(L.rmx + R.lmx, max(L.mx, R.mx));
if(L.lmx == L.r - L.l + 1) res.lmx = L.lmx + R.lmx;
else res.lmx = L.lmx;
/*R写成L了 */if(R.rmx == R.r - R.l + 1) res.rmx = R.rmx + L.rmx;
else res.rmx = R.rmx;
return res;
}
by waver_rui @ 2023-07-19 12:32:00
@[waver_rui](/user/149678) 感觉没问题吧这里
by liuyufeng1 @ 2023-07-19 20:34:36
但是你判断的是[mid+1,R]是否全满啊/fad
by waver_rui @ 2023-07-19 21:12:26
@[liuyufeng1](/user/368515)
by waver_rui @ 2023-07-19 21:16:14
已过%%%
by liuyufeng1 @ 2023-07-19 22:01:57