[poj 3468]A Simple Problem with Interger[线段树][区间更新]
题意:给出N个数,有两种操作:"Cabc"meansaddingctoeachofAa,Aa+1,...,Ab.-10000≤c≤10000."Qab"meansqueryingthesumofAa,Aa+1,...,Ab.回答每个询问.思路:裸的线段树区间更新,注意范围.重新熟悉线段树的流程,按照其合理性去记忆每一步.#include
#include
usingnamespacestd;
#d