-
Notifications
You must be signed in to change notification settings - Fork 0
/
segtree2.cpp
112 lines (103 loc) · 4.03 KB
/
segtree2.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
#include<bits/stdc++.h>
#define endl "\n"
#define INF 0x3f3f3f3f
#define Maxn 100005
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
class Segtree{
public:
long long n;
long long ans[Maxn * 4]; //树
long long a[Maxn]; //数据数组
long long tag[Maxn * 4]; //懒标记
inline long long left_son(long long p){
return p << 1; //p*2
}
inline long long right_son(long long p){
return p << 1 | 1; //p * 2 + 1
}
inline void upward_update(long long p){ //向上更新
ans[p] = ans[left_son(p)] + ans[right_son(p)];
}
inline void build(long long p, long long l,long long r){ //建树
tag[p] = 0; //初始化懒标记为0
if(l == r){ //若左标记等于右标记,说明为叶子节点
ans[p] = a[l];
return;
}
long long mid = (l + r) >> 1; //计算中值
build(left_son(p),l,mid); //建左子树
build(right_son(p), mid+1,r); //建右子树
upward_update(p); //更新节点p
}
inline void tag_update(long long p, long long l,long long r,long long k){
tag[p] += k; //标记这个节点每个子节点均被加k,但未被更新
ans[p] += k * (r - l + 1); //更新该节点结果值
}
inline void downward_update(long long p,long long l,long long r){
long long mid = (l + r) >> 1;
tag_update(left_son(p),l,mid,tag[p]); //更新左子节点的tag和值
tag_update(right_son(p),mid+1,r,tag[p]); //更新右子节点的tag和值
tag[p] = 0; //将懒标记清零
}
inline void update(long long p,long long l0, long long r0, long long l, long long r,long long k){
//l0,r0 为需要更改的区间范围
//l,r 为当前所在的区间范围
long long mid = (l + r) >> 1;
if(l0 <= l && r <= r0){ //范围完全覆盖
tag_update(p,l,r,k);
return;
}
downward_update(p,l,r); //范围未完全覆盖,向下更新
if(l0 <= mid){
update(left_son(p),l0,r0,l,mid,k);
}
if(r0 > mid){
update(right_son(p),l0,r0,mid+1,r,k);
}
upward_update(p);
}
long long query(long long l0,long long r0,long long l, long long r,long long p){
//l0,r0 为需要更改的区间范围
//l,r 为当前所在的区间范围
long long mid = (l + r) >> 1;
long long res = 0;
if(l0 <= l && r0 >=r){ //若完全覆盖则直接返回节点值
return ans[p];
}
downward_update(p,l,r); //向下更新懒标记
if(l0 <= mid){
res += query(l0,r0,l,mid,left_son(p));
}
if(r0 > mid){
res += query(l0,r0,mid+1,r,right_son(p));
}
return res;
}
};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n,m; //n:数字个数 m:操作个数
cin>>n>>m;
Segtree seg;
for(long long i = 1; i <= n; i++)
{
cin>>seg.a[i];
}
seg.build(1,1,n); //构建树
for(long long i = 0; i < m; i++){
int type;
cin>>type;
if(type == 1){
long long x,y,k;
cin>>x>>y>>k;
seg.update(1,x,y,1,n,k); //更新
}else{
long long x,y;
cin>>x>>y;
cout<<seg.query(x,y,1,n,1)<<endl; //查询
}
}
return 0;
}