POJ 3468
- 当需要区间修改而不是单点修改时.如果仍用单点修改来修改区间的所有点.必超时
- 若修改区间为
[l,r]
,且覆盖节点p
的[e[p].left,e[p].right]
.为了避免修改子树所有节点(可能修改了后都用不到,浪费时间). - 修改该节点的区间值,且标记,当我们需要递归到子树时,在来一层一层更新
#include <iostream>
#include <string.h>
using namespace std;
const int maxn = 1e5+5;
struct segementTree {
int l,r;
long long sum,add;
#define left(x) tree[x].l
#define right(x) tree[x].r
#define sum(x) tree[x].sum
#define add(x) tree[x].add
} tree[4*maxn];
int num[maxn];
int n,m;
void build(int p,int left,int right) {
left(p) = left; right(p) = right;
if (left == right) {
sum(p)=num[left];
return ;
}
int mid = (left + right)/2;
build(2*p,left,mid);
build(2*p+1,mid+1,right);
sum(p) = sum(p*2) + sum(p*2+1);
return ;
}
void spread(int p) {
if (add(p)) {
sum(p*2) += add(p)*(right(p*2) - left(p*2) + 1);
sum(p*2+1) += add(p)*(right(p*2+1) - left(p*2+1) + 1);
add(p*2) += add(p);
add(p*2+1) += add(p);
add(p) = 0;
}
}
void change(int p,int left,int right,int val) {
if (left <=left(p) && right(p)<=right) {
sum(p) += (long long)val * (right(p) - left(p) + 1);
add(p) += (long long)val;
return ;
}
spread(p);
int mid = (left(p) + right(p))/2;
if (left <= mid) change(2*p,left,right,val);
if (right > mid) change(2*p+1,left,right,val);
sum(p) = sum(p*2) + sum(p*2+1);
}
long long ask(int p,int left,int right) {
if (left <= left(p) && right(p) <= right) return sum(p);
spread(p);
int mid = (left(p) + right(p))/2;
long long val = 0;
if (left <= mid) val += ask(2*p,left,right);
if (right > mid) val += ask(2*p+1,left,right);
return val;
}
int main() {
cin >> n >> m;
for (int i=1; i<=n; i++) scanf("%d",&num[i]);
build(1,1,n);
char ch[2]; int u,v,w;
for (int i=1; i<=m; i++) {
scanf("%s%d%d",ch,&u,&v);
if (ch[0] == 'Q')
printf("%lld\n",ask(1,u,v));
else {
scanf("%d",&w);
change(1,u,v,w);
}
}
return 0;
}