poj3468(线段树区间更新)
题目链接解题说明:裸题模板ac代码:#include<iostream>#include<algorithm>#include<string>using namespace std;const int MAXN=1e5+10;typedef long long ll;ll s[MAXN<<2],col[MAXN&a