- #include <cstdio>
- #define LL __int64
- const int N = 500010;
- LL num[N], sum[N], add[N], v;
- void pushDown(int i, int l, int r) {
- if(add[i] != 0) {
- int mid = l + r >> 1;
- add[i << 1] += add[i];
- sum[i << 1] += (mid - l + 1) * add[i]; //[l, mid]代表左儿子区间
- add[i << 1 | 1] += add[i];
- sum[i << 1 | 1] += (r - mid) * add[i]; //[mid + 1, r]代表右儿子区间
- add[i] = 0;
- }
- }
- void update(int i, int l, int r, int ql, int qr, int val) {
- if(l > qr || ql > r)
- return ;
- if(l >= ql && r <= qr){
- sum[i] += (r - l + 1) * val;
- add[i] += val;
- return ;
- }
- pushDown(i, l, r);
- int mid = l + r >> 1;
- update(i << 1, l, mid, ql, qr, val);
- update(i << 1 | 1, mid + 1, r, ql, qr, val);
- sum[i] = sum[i << 1] + sum[i << 1 | 1];
- }
- LL query(int i, int l, int r, int ql, int qr) {
- if(l > qr || ql > r)
- return 0;
- if(l >= ql && r <= qr)
- return sum[i];
- pushDown(i, l, r);
- int mid = l + r >> 1;
- return query(i << 1, l, mid, ql, qr)
- + query(i << 1 | 1, mid + 1, r, ql, qr);
- }
- int main() {
- int n, q, l, r;
- char ord;
- scanf("%d%d", &n, &q);
- for(int i = 1; i <= n; i++) {
- scanf("%lld", &num[i]);
- update(1, 1, n, i, i, num[i]);
- }
- while(q--) {
- scanf("\n%c", &ord);
- if(ord == 'Q') {
- scanf("%d%d", &l, &r);
- printf("%lld\n", query(1, 1, n, l, r));
- } else {
- scanf("%d%d%lld", &l, &r, &v);
- update(1, 1, n, l, r, v);
- }
- }
- return 0;
- }
线段树 (区间更新求和)
最新推荐文章于 2020-10-05 18:13:48 发布