【HDOJ】4348 To the moon

主席树区间更新，延迟标记。

 /* 4348 */
 #include <iostream>
 #include <sstream>
 #include <string>
 #include <map>
 #include <queue>
 #include <set>
 #include <stack>
 #include <vector>
 #include <deque>
 #include <algorithm>
 #include <cstdio>
 #include <cmath>
 #include <ctime>
 #include <cstring>
 #include <climits>
 #include <cctype>
 #include <cassert>
 #include <functional>
 #include <iterator>
 #include <iomanip>
 using namespace std;
 //#pragma comment(linker,"/STACK:102400000,1024000")

 #define sti                set<int>
 #define stpii            set<pair<int, int> >
 #define mpii            map<int,int>
 #define vi                vector<int>
 #define pii                pair<int,int>
 #define vpii            vector<pair<int,int> >
 #define rep(i, a, n)     for (int i=a;i<n;++i)
 #define per(i, a, n)     for (int i=n-1;i>=a;--i)
 #define clr                clear
 #define pb                 push_back
 #define mp                 make_pair
 #define fir                first
 #define sec                second
 #define all(x)             (x).begin(),(x).end()
 #define SZ(x)             ((int)(x).size())
 // #define lson            l, mid, rt<<1
 // #define rson            mid+1, r, rt<<1|1

 const int maxn = 1e5+;
 const int maxm = 5e6+;
 int T[maxn];
 int lson[maxm], rson[maxm];
 __int64 sum[maxm], delta[maxm];
 int a[maxn];
 int tot, n, q;

 inline void PushUp(int rt) {
     sum[rt] = sum[lson[rt]] + sum[rson[rt]];
 }

 void init() {
     tot = ;
 }

 int Build(int l, int r) {
     int rt = tot++;
     delta[rt] = ;

     if (l == r) {
         sum[rt] = a[l];
         return rt;
     }

     int mid = (l + r) >> ;

     lson[rt] = Build(l, mid);
     rson[rt] = Build(mid+, r);

     PushUp(rt);
     return rt;
 }

 void copy(int d, int s) {
     lson[d] = lson[s];
     rson[d] = rson[s];
     delta[d] = delta[s];
     sum[d] = sum[s];
 }

 int Update(int rt, int L, int R, int val, int l, int r) {
     int nrt = tot++;

     copy(nrt, rt);
     sum[nrt] += 1LL * val * (R - L + );
     if (L==l && R==r) {
         delta[nrt] += val;
         return nrt;
     }

     int mid = (l + r) >> ;

     if (R <= mid) {
         lson[nrt] = Update(lson[rt], L, R, val, l, mid);
     } else if (L > mid) {
         rson[nrt] = Update(rson[rt], L, R, val, mid+, r);
     } else {
         lson[nrt] = Update(lson[rt], L, mid, val, l, mid);
         rson[nrt] = Update(rson[rt], mid+, R, val, mid+, r);
     }

     return nrt;
 }

 __int64 Query(int rt, int L, int R, int l, int r) {
     if (L==l && R==r)  {
         return sum[rt];
     }

     int mid = (l + r) >> ;
     __int64 ret = 1LL * (R-L+) * delta[rt];

     if (R <= mid) {
         ret += Query(lson[rt], L, R, l, mid);
     } else if (L > mid) {
         ret += Query(rson[rt], L, R, mid+, r);
     } else {
         ret += Query(lson[rt], L, mid, l, mid);
         ret += Query(rson[rt], mid+, R, mid+, r);
     }

     return ret;
 }

 void solve() {
     int cur = ;
     char op[];
     int l, r, d, t;
     __int64 ans;

     init();
     T[] = Build(, n);
     while (q--) {
         scanf("%s", op);
         if (op[] == 'B') {
             scanf("%d", &cur);
         } else if (op[] == 'Q') {
             scanf("%d %d", &l, &r);
             t = cur;
             ans = Query(T[t], l, r, , n);
             printf("%I64d\n", ans);
         } else if (op[] == 'H') {
             scanf("%d %d %d", &l, &r, &t);
             ans = Query(T[t], l, r, , n);
             printf("%I64d\n", ans);
         } else {
             scanf("%d %d %d", &l, &r, &d);
             T[cur+] = Update(T[cur], l, r, d, , n);
             ++cur;
         }
     }
 }

 int main() {
     ios::sync_with_stdio(false);
     #ifndef ONLINE_JUDGE
         freopen("data.in", "r", stdin);
         freopen("data.out", "w", stdout);
     #endif

     while (scanf("%d %d", &n, &q)!=EOF) {
         rep(i, , n+)
             scanf("%d", &a[i]);
         solve();
     }

     #ifndef ONLINE_JUDGE
         printf("time = %d.\n", (int)clock());
     #endif

     return ;
 }