Tachibana27 @ 2024-02-24 10:13:21
rt,分块的区间加操作写成这样:
if(sd==ed)
for(int i=l;i<=r;i++){
a[i]+=x;
b[ed]+=x;
break;
}
为啥能A?
by Tachibana27 @ 2024-02-24 10:14:14
就是为啥加上 break
也可以过啊
验证码dp88寄
by return_TLE @ 2024-02-24 10:30:16
你说的对,但是这道题本来是想要让你用线段树实现的
by rhq2022 @ 2024-02-24 10:35:44
666