AizuOj DSL_2_G RSQ and RAQ（线段树）

区间更新、区间查询，因为long long卡了半天
题目链接：http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_G
solution：

#include 
using namespace std;
#define MAXN 100005
#define Mid ((l+r)>>1)
#define lson rt<<1,l,Mid
#define rson rt<<1|1,Mid+1,rlong long arr[MAXN << 2], lazy[MAXN << 2];inline void push_up(long long rt)
{arr[rt] = arr[rt << 1] + arr[rt << 1 | 1];
}void build(long long rt, long long l, long long r)
{if (l == r)arr[rt] = 0;else{build(lson);build(rson);push_up(rt);}
}inline void f(long long rt, long long l, long long r, long long k)
{lazy[rt] += k;arr[rt] += k * (r - l + 1);//该区间统一改变、所以arr加上元素个数
}inline void push_down(long long rt, long long l, long long r)
{f(rt << 1, l, Mid, lazy[rt]);f(rt << 1 | 1, Mid + 1, r, lazy[rt]);lazy[rt] = 0;
}inline void updata(long long rt, long long l, long long r, long long L, long long R, long long k)
{if (l >= L && r <= R){arr[rt] += k * (r - l + 1);lazy[rt] += k;}else{push_down(rt, l, r);if (L <= Mid)updata(lson, L, R, k);if (R > Mid)updata(rson, L, R, k);push_up(rt);}
}long long query(long long rt, long long l, long long r, long long L, long long R)
{long long res = 0;if (L <= l && R >= r)return arr[rt];push_down(rt, l, r);if (L <= Mid)res += query(lson, L, R);if (R > Mid)res += query(rson, L, R);return res;
}int main()
{long long n, q, ch, a, b, c;scanf("%lld%lld", &n, &q);build(1, 1, n);while (q--){scanf("%lld", &ch);if (ch){scanf("%lld%lld", &a, &b);printf("%lld\n", query(1, 1, n, a, b));}else{scanf("%lld%lld%lld", &a, &b, &c);updata(1, 1, n, a, b, c);}}return 0;
}

本文来自互联网用户投稿，文章观点仅代表作者本人，不代表本站立场，不承担相关法律责任。如若转载，请注明出处。 如若内容造成侵权/违法违规/事实不符，请点击【内容举报】进行投诉反馈！