Codeforces Round #250 D - The Child and Sequence/[TYVJ3838] DQS和序列(by 帝江&Darkfalmes)
题目大意有三种操作:求和,区间取模,单点修改n,m>1;
build(a*2,l,mid);build(a*2+1,mid+1,r);
w[a,1]:=w[a*2,1]+w[a*2+1,1];
ifw[a*2,2]>w[a*2+1,2]
thenw[a,2]:=w[a*2,2]elsew[a,2]:=w[a*2+1,2];
end;
functionquery(a,x,y,l,r:longint