@[花园Serena](/user/86973)
```cpp
for(R i = 1; i <= m; i ++) {
scanf("%d%d", &q[i].l, &q[i].r);
q[i].id = i; q[i].op = ((i - 1) / size + 1);
}
```
您是按啥分块的？
按询问分块？这是莫队吗QAQ
by ducati @ 2020-11-24 16:26:37
@[花园Serena](/user/86973) 也就是您$q_{i}.op$求错啦
by ducati @ 2020-11-24 16:27:10
@[ducati](/user/87064) 这应该是奇偶性优化
by 幻影星坚强 @ 2020-11-24 16:41:28
@[幻影星坚强](/user/111728) 但是本蒟蒻觉得这位巨佬好像排序写挂了吧
by ducati @ 2020-11-24 16:46:19
@[ducati](/user/87064) 哦我是sb
by 花园Serena @ 2020-11-24 16:57:00
@[ducati](/user/87064) 我直接拿i分块的草
by 花园Serena @ 2020-11-24 16:57:22
@[ducati](/user/87064) 草还过了小B的询问
by 花园Serena @ 2020-11-24 16:58:52
啾啾猫猫
by Rbu_nas @ 2020-11-24 17:00:39
@[花园Serena](/user/86973) 这里最好这么写，先扩大区间再缩小区间。
```cpp
while (l > q[i].l) add(-- l);
while (r < q[i].r) add(++ r);
while (l < q[i].l) del(l ++);
while (r > q[i].r) del(r --);
```
否则有些元素加入会有问题
by Rbu_nas @ 2020-11-24 17:03:20
@[Rbu_nas](/user/80358) 好的好的
by 花园Serena @ 2020-11-24 17:06:19