poj3468(lazy标记)
//poj3468区间成段更新,使用lazy标记#include#includeusing namespace std;const int maxn=100005;long long sum[maxn<<2],cov[maxn<<2];int a[maxn];void Pushup(int p){ sum[p]=sum[p<<1]+sum[p<<1|1]; //该区间