摘要： http://acm.hrbeu.edu.cn/index.php?act=problem&id=1008&cid=115线段树，标记。How ManyTimeLimit: 10 Second MemoryLimit: 32 MegabyteTotalsubmit: 188 Accepted: 35 Descriptionyou are given a sequence A[1], A[2],..., A[N]. On this sequence you have to apply M operations: Add all the elements whose positio 阅读全文