我们相距十万光年

晨露正葱茏，来日盛景定无穷

11/8
16:25
ACM-ICPC

线段树 Segment Tree

saruka 撰写 无回复

线段树（Segment Tree）是一种数据结构，它支持区间最大值、最小值以及区间和的查询的修改操作，时间复杂度O（nlogn）。

C++
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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
 
using namespace std;
 
typedef long long LL;
 
const int maxn = 100005;
 
int n, m, x, y, opt = 0;
LL z;
LL a[maxn];
 
struct Segment_Tree
{
LL l, r, sum, max_val, min_val, tag;
} tree[maxn << 4];
 
inline int getint()
{
int r = 0, k = 1;
char c = getchar();
for(; c < '0' || c > '9'; c = getchar())
if(c == '-') k = -1;
for(; c >= '0' && c <= '9'; c = getchar())
r = r * 10 + c - '0';
return r * k;
}
 
inline LL getll()
{
LL r = 0, k = 1;
char c = getchar();
for(; c < '0' || c > '9'; c = getchar())
if(c == '-') k = -1;
for(; c >= '0' && c <= '9'; c = getchar())
r = r * 10 + c - '0';
return r * k;
}
 
void push_up(int now)
{
tree[now].sum = tree[now << 1].sum + tree[now << 1 | 1].sum;
tree[now].max_val = max(tree[now << 1].max_val, tree[now << 1 | 1].max_val);
tree[now].min_val = min(tree[now << 1].min_val, tree[now << 1 | 1].min_val);
return;
}
 
void push_down(int now)
{
tree[now << 1].tag += tree[now].tag;
tree[now << 1].sum += tree[now].tag * (tree[now << 1].r - tree[now << 1].l + 1);
tree[now << 1].max_val += tree[now].tag;
tree[now << 1].min_val += tree[now].tag;
 
tree[now << 1 | 1].tag += tree[now].tag;
tree[now << 1 | 1].sum += tree[now].tag * (tree[now << 1 | 1].r - tree[now << 1 | 1].l + 1);
tree[now << 1 | 1].max_val += tree[now].tag;
tree[now << 1 | 1].min_val += tree[now].tag;
 
tree[now].tag = 0;
 
return;
}
 
void build(int now, int l, int r)
{
tree[now].l = l;
tree[now].r = r;
tree[now].tag = 0;
 
if(l == r)
{
tree[now].sum = tree[now].max_val = tree[now].min_val = a[l];
return;
}
 
int mid = (tree[now].l + tree[now].r) >> 1;
build(now << 1, l, mid);
build(now << 1 | 1, mid + 1, r);
 
push_up(now);
return;
}
 
void update(int now, int ll, int rr, LL x)
{
if(ll <= tree[now].l && tree[now].r <= rr)
{
tree[now].tag += x;
tree[now].sum += x * (tree[now].r - tree[now].l + 1);
tree[now].max_val += x;
tree[now].min_val += x;
return;
}
 
push_down(now);
 
int mid = (tree[now].l + tree[now].r) >> 1;
if(rr <= mid) update(now << 1, ll, rr, x);
else if(ll > mid) update(now << 1 | 1, ll, rr, x);
else
{
update(now << 1, ll, mid, x);
update(now << 1 | 1, mid + 1, rr, x);
}
 
push_up(now);
return;
}
 
LL query_sum(int now, int ll, int rr)
{
if(ll <= tree[now].l && tree[now].r <= rr) return tree[now].sum;
push_down(now);
 
int mid = (tree[now].l + tree[now].r) >> 1;
if(rr <= mid) return query_sum(now << 1, ll, rr);
else if(ll > mid) return query_sum(now << 1 | 1, ll, rr);
else return (query_sum(now << 1, ll, mid) + query_sum(now << 1 | 1, mid + 1, rr));
}
 
LL query_max(int now, int ll, int rr)
{
if(ll <= tree[now].l && tree[now].r <= rr) return tree[now].max_val;
push_down(now);
 
int mid = (tree[now].l + tree[now].r) >> 1;
if(rr <= mid) return query_max(now << 1, ll, rr);
else if(ll > mid) return query_max(now << 1 | 1, ll, rr);
else return max(query_max(now << 1, ll, mid), query_max(now << 1 | 1, mid + 1, rr));
}
 
LL query_min(int now, int ll, int rr)
{
if(ll <= tree[now].l && tree[now].r <= rr) return tree[now].max_val;
push_down(now);
 
int mid = (tree[now].l + tree[now].r) >> 1;
if(rr <= mid) return query_min(now << 1, ll, rr);
else if(ll > mid) return query_min(now << 1 | 1, ll, rr);
else return min(query_min(now << 1, ll, mid), query_min(now << 1 | 1, mid + 1, rr));
}
 
int main(int argc, char const * argv[])
{
ios :: sync_with_stdio(false);
 
n = getint();
m = getint();
 
for(int i = 1; i <= n; i++) a[i] = getll();
 
build(1, 1, n);
 
while(m--)
{
opt = getint();
x = getint();
y = getint();
 
if(opt == 1)
{
z = getll();
update(1, x, y, z);
}
 
else if(opt == 2)
{
printf("%lld\n", query_sum(1, x, y));
}
}
 
return 0;
}

Copyright © 2018 All Rights Resered.