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
181
182
183
184
185
186
187
|
1;单点增减
#define lson l, m , rt << 1
#define rson m + 1 ,r , rt << 1 | 1
const int maxn = 55555;
int sum[maxn<<2];
void (int rt)
{
sum[rt] = sum[rt<<1] + sum[rt<<1|1];
}
void build(int l,int r,int rt)
{
if(l == r)
{
scanf("%d",&sum[rt]);
return ;
}
int m = (l + r) >> 1;
build(lson);
build(rson);
PushUP(rt);
}
void update(int p,int add,int l,int r,int rt)
{
if (l == r)
{
sum[rt] += add; return ;
}
int m = (l + r) >> 1;
if (p <= m) update(p , add , lson);
else update(p , add , rson); PushUP(rt);
}
int query(int L,int R,int l,int r,int rt)
{
if (L <= l && r <= R) { return sum[rt]; }
int m = (l + r) >> 1;
int ret = 0;
if (L <= m) ret += query(L , R , lson);
if (R > m) ret += query(L , R , rson);
return ret;
}
int main()
{
int T , n;
scanf("%d",&T);
for (int cas = 1 ; cas <= T ; cas ++)
{
printf("Case %d:n",cas);
scanf("%d",&n);
build(1 , n , 1);
char op[10];
while(scanf("%s",op)) { if (op[0] == 'E') break;
int a , b;
scanf("%d%d",&a,&b);
if (op[0] == 'Q')
printf("%dn",query(a , b , 1 , n , 1));
else if (op[0] == 'S')
update(a , -b , 1 , n , 1);
else
update(a , b , 1 , n , 1); }
}
return 0;
}
2：区间增减
#define lson l,m,rt<<1
#define rson m + 1,r,rt <<1|1
const int Maxn=100005;
int add[Maxn*4],sum[Maxn*4];
void PushUp(int rt)
{
sum[rt] = sum[rt<<1] + sum[rt<<1|1];
}
void PushDown(int rt,int m)
{
if(add[rt])
{
add[rt<<1] += add[rt];
add[rt<<1|1]+=add[rt];
sum[rt<<1] += (m-(m>>1))*add[rt];
sum[rt<<1|1]+=(m>>1)*add[rt];
add[rt] = 0;
}
}
void build(int l,int r,int rt)
{
add[rt] = 0;
if (l == r)
{
sum[rt]=w[k++];
return ;
}
int m = (l + r) >> 1;
build(lson); build(rson);
PushUp(rt);
}
void update(int L,int R,int c,int l,int r,int rt)
{
if(L<=l && r<=R)
{
add[rt] += c;
sum[rt] += c * (r - l + 1);
return ;
}
PushDown(rt,r-l+1);
int m = (l + r) >> 1;
if (L <= m) update(L , R , c , lson);
if (m < R) update(L , R , c , rson);
PushUp(rt);
}
ll query(int L,int R,int l,int r,int rt)
{
if (L <= l && r <= R)
{
return sum[rt];
}
PushDown(rt,r-l+1);
int m = (l+r)>>1;
ll ret = 0;
if (L <= m) ret += query(L,R,lson);
if (m < R) ret += query(L,R,rson);
return ret;
}
3：区间替换
#include<cstdio>
#include<algorithm>
using namespace std;
#define lson l, m , rt << 1
#define rson m + 1 ,r , rt << 1 | 1
const int maxn = 111111;
int h , w , n;
int col[maxn<<2];
int sum[maxn<<2];
void PushUp(int rt)
{
sum[rt] = sum[rt<<1] + sum[rt<<1|1];
}
void PushDown(int rt,int m)
{
if (col[rt])
{
col[rt<<1] = col[rt<<1|1] = col[rt];
sum[rt<<1] = (m - (m >> 1)) * col[rt];
sum[rt<<1|1] = (m >> 1) * col[rt];
col[rt] = 0;
}
}
void build(int l,int r,int rt)
{
col[rt] = 0; sum[rt] = 1;
if (l == r) return ;
int m = (l + r) >> 1;
build(lson); build(rson);
PushUp(rt);
}
void update(int L,int R,int c,int l,int r,int rt)
{
if (L <= l && r <= R)
{
col[rt] = c; sum[rt] = c * (r - l + 1);
return ;
}
PushDown(rt , r - l + 1);
int m = (l + r) >> 1;
if (L <= m) update(L , R , c , lson);
if (R > m) update(L , R , c , rson);
PushUp(rt);
}
int query(int L,int R,int l,int r,int rt)
{
if (L <= l && r <= R)
return sum[rt];
PushDown(rt , r - l + 1);
int m = (l + r) >> 1;
int ans=0;
if (L <= m) ans+=query(L , R , lson);
if (R > m) ans+=query(L , R , rson);
PushUp(rt);
return ans;
}
int main()
{
return 0;
}
|
近期评论