hdu4348 - To the moon 可持久化线段树 区间修改 离线处理

法一：暴力！

让干什么就干什么，那么久需要可持久化线段树了。

但是空间好紧。怎么破？

不down标记好了！

每个点维护sum和add两个信息，sum是这段真实的和，add是这段整体加了多少，如果这段区间被完全包含，返回sum，否则加上add * 询问落在这段区间的长度再递归回答。

怎么还是MLE？

麻辣鸡指针好像8字节，所以改成数组的就过了。。。

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<iostream>

using namespace std;

template<typename Q> Q &read(Q &x) {
    static char c, f;
    for(f = ; c = getchar(), !isdigit(c); ) if(c == '-') f = ;
    for(x = ; isdigit(c); c = getchar()) x = x *  + c - '';
    if(f) x = -x; return x;
}
template<typename Q> Q read() {
    static Q x; read(x); return x;
}

typedef long long LL;
const int N =  + ;
struct Node *pis;
struct Node {
    LL sum, add;
    Node *ch[];

    Node *modify(int l, int r, int L, int R, LL d) {
        Node *o = new Node(*this);
        if(L <= l && r <= R) {
            o->add += d;
            o->sum += (r - l + ) * d;
            return o;
        }
        int mid = (l + r) >> ;
        if(L <= mid) o->ch[] = ch[]->modify(l, mid, L, R, d);
        if(mid < R) o->ch[] = ch[]->modify(mid + , r, L, R, d);
        o->sum = o->ch[]->sum + o->ch[]->sum + o->add * (r - l + );
        return o;
    }

    LL query(int l, int r, int L, int R) {
        if(L <= l && r <= R) return sum;
        int mid = (l + r) >> ;
        LL res = (min(R, r) - max(L, l) + ) * add;
        if(L <= mid) res += ch[]->query(l, mid, L, R);
        if(mid < R) res += ch[]->query(mid + , r, L, R);
        return res;
    }

    void *operator new(size_t) {
        return pis++;
    }
}pool[ + ], *root[N];

void build(Node *&o, int l, int r) {
    o = new Node, o->add = ;
    if(l == r) return read(o->sum), void();
    int mid = (l + r) >> ;
    build(o->ch[], l, mid);
    build(o->ch[], mid + , r);
    o->sum = o->ch[]->sum + o->ch[]->sum;
}

int main() {
#ifdef DEBUG
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif

    int n, m, cur;
    char opt[];
    while(scanf("%d%d", &n, &m) == ) {
        cur = , pis = pool;
        build(root[cur], , n);
        while(m--) {
            if(m == ) {
                int debug = ;
            }
            scanf("%s", opt);
            if(opt[] == 'C') {
                int l, r; LL d;
                read(l), read(r), read(d);
                root[cur + ] = root[cur]->modify(, n, l, r, d);
                cur++;
            }else if(opt[] == 'Q') {
                int l, r; read(l), read(r);
                printf("%I64d\n", root[cur]->query(, n, l, r));
            }else if(opt[] == 'H') {
                int l, r, t; read(l), read(r), read(t);
                printf("%I64d\n", root[t]->query(, n, l, r));
            }else read(cur);
        }
        puts("");
    }

    return ;
}

指针版

 #include<cstdio>
 #include<cstring>
 #include<cstdlib>
 #include<algorithm>
 #include<iostream>

 using namespace std;

 template<typename Q> Q &read(Q &x) {
     static char c, f;
     for(f = ; c = getchar(), !isdigit(c); ) if(c == '-') f = ;
     for(x = ; isdigit(c); c = getchar()) x = x *  + c - '';
     if(f) x = -x; return x;
 }
 template<typename Q> Q read() {
     static Q x; read(x); return x;
 }

 typedef long long LL;
 const int N =  + ;

 int ch[N][], tot, root[N];
 LL sum[N], add[N];

 int modify(int s, int l, int r, int L, int R, LL d) {
     int x = tot++;
     sum[x] = sum[s];
     add[x] = add[s];
     ch[x][] = ch[s][];
     ch[x][] = ch[s][];

     if(L <= l && r <= R) {
         add[x] += d;
         sum[x] += (r - l + ) * d;
     }else {
         int mid = (l + r) >> ;
         if(L <= mid) ch[x][] = modify(ch[s][], l, mid, L, R, d);
         if(mid < R) ch[x][] = modify(ch[s][], mid + , r, L, R, d);
         sum[x] = sum[ch[x][]] + sum[ch[x][]] + add[x] * (r - l + );
     }
     return x;
 }

 LL query(int s, int l, int r, int L, int R) {
     if(L <= l && r <= R) return sum[s];
     int mid = (l + r) >> ;
     LL res = (min(R, r) - max(L, l) + ) * add[s];
     if(L <= mid) res += query(ch[s][], l, mid, L, R);
     if(mid < R) res += query(ch[s][], mid + , r, L, R);
     return res;
 }

 void build(int &s, int l, int r) {
     s = tot++, add[s] = ;
     if(l == r) return read(sum[s]), void();
     int mid = (l + r) >> ;
     build(ch[s][], l, mid);
     build(ch[s][], mid + , r);
     sum[s] = sum[ch[s][]] + sum[ch[s][]];
 }

 int main() {
 #ifdef DEBUG
     freopen("in.txt", "r", stdin);
     freopen("out.txt", "w", stdout);
 #endif

     int n, m, cur;
     char opt[];
     while(scanf("%d%d", &n, &m) == ) {
         cur = tot = ;
         build(root[cur], , n);
         while(m--) {
             if(m == ) {
                 int debug = ;
             }
             scanf("%s", opt);
             if(opt[] == 'C') {
                 int l, r; LL d;
                 read(l), read(r), read(d);
                 root[cur + ] = modify(root[cur], , n, l, r, d);
                 cur++;
             }else if(opt[] == 'Q') {
                 int l, r; read(l), read(r);
                 printf("%I64d\n", query(root[cur], , n, l, r));
             }else if(opt[] == 'H') {
                 int l, r, t; read(l), read(r), read(t);
                 printf("%I64d\n", query(root[t], , n, l, r));
             }else read(cur);
         }
 //        puts("");
     }

     return ;
 }

数组版

法二：离线！

主要需要处理H操作。

在第一遍读入数据的时候维护一个pos[]数组，表示当前第i个版本是由pos[i]这个C操作创建的。

然后碰到H就把它挂在pos[t]上就可以，第二遍处理的时候直接回答。

 #include<cstdio>
 #include<cstring>
 #include<cstdlib>
 #include<algorithm>
 #include<iostream>

 using namespace std;

 template<typename Q> Q &read(Q &x) {
     static char c, f;
     for(f = ; c = getchar(), !isdigit(c); ) if(c == '-') f = ;
     for(x = ; isdigit(c); c = getchar()) x = x *  + c - '';
     if(f) x = -x; return x;
 }
 template<typename Q> Q read() {
     static Q x; read(x); return x;
 }

 typedef long long LL;
 const int N =  + ;

 int n, m;
 class SegementTree {
     private:
     LL sum[N * ], tag[N * ];

     #define mid ((l + r) >> 1)
     #define ls s << 1, l, mid
     #define rs s << 1 | 1, mid + 1, r

     void add_tag(int s, int l, int r, LL d) {
         tag[s] += d;
         sum[s] += (r - l + ) * d;
     }

     void down(int s, int l, int r) {
         if(tag[s]) {
             add_tag(ls, tag[s]);
             add_tag(rs, tag[s]);
             tag[s] = ;
         }
     }

     int lft, rgt;
     LL w;

     void modify(int s, int l, int r) {
         if(lft <= l && r <= rgt) return add_tag(s, l, r, w);
         down(s, l, r);
         if(lft <= mid) modify(ls);
         if(mid < rgt) modify(rs);
         sum[s] = sum[s << ] + sum[s <<  | ];
     }

     LL query(int s, int l, int r) {
         if(lft <= l && r <= rgt) return sum[s];
         down(s, l, r);
         if(rgt <= mid) return query(ls);
         if(mid < lft) return query(rs);
         return query(ls) + query(rs);
     }

     public:
     void build(int s, int l, int r) {
         tag[s] = ;
         if(l == r) return read(sum[s]), void();
         build(ls), build(rs);
         sum[s] = sum[s << ] + sum[s <<  | ];
     }
     #undef mid
     #undef ls
     #undef rs

     void Modify(int l, int r, LL w) {
         lft = l, rgt = r, this->w = w;
         modify(, , n);
     }
     LL Query(int l, int r) {
         lft = l, rgt = r;
         return query(, , n);
     }
 }seg;

 struct operation {
     char tp;
     int l, r;
     LL d;
 }opt[N];

 #include<stack>
 stack<int> stk;

 #include<vector>
 vector<int> G[N];

 int pos[N];
 LL ans[N];

 int main() {
 #ifdef DEBUG
     freopen("in.txt", "r", stdin);
     freopen("out.txt", "w", stdout);
 #endif

     char s[];
     while(scanf("%d%d", &n, &m) == ) {
         seg.build(, , n);
         int cur = ;
         for(int i = ; i < m; i++) {
             scanf("%s", s);
             opt[i].tp = s[];
             if(s[] == 'C') {
                 read(opt[i].l), read(opt[i].r), read(opt[i].d);
                 pos[++cur] = i;
             }else if(s[] == 'Q') {
                 read(opt[i].l), read(opt[i].r);
             }else if(s[] == 'H') {
                 read(opt[i].l), read(opt[i].r), read(opt[i].d);
                 if(!opt[i].d) ans[i] = seg.Query(opt[i].l, opt[i].r);
                 else G[pos[opt[i].d]].push_back(i);
             }else cur = read(opt[i].d);
         }

         cur = ;
         for(int i = ; i < m; i++) {
             if(opt[i].tp == 'C') {
                 seg.Modify(opt[i].l, opt[i].r, opt[i].d);
                 for(unsigned j = ; j < G[i].size(); j++) {
                     int k = G[i][j];
                     ans[k] = seg.Query(opt[k].l, opt[k].r);
                 }
                 ++cur;
                 stk.push(i);
             }else if(opt[i].tp == 'Q') {
                 ans[i] = seg.Query(opt[i].l, opt[i].r);
             }else if(opt[i].tp == 'B') {
                 while(cur > opt[i].d) {
                     int k = stk.top(); stk.pop();
                     seg.Modify(opt[k].l, opt[k].r, -opt[k].d);
                     cur--;
                 }
             }
         }

         for(int i = ; i < m; i++) {
             if(opt[i].tp == 'Q' || opt[i].tp == 'H') {
                 printf("%I64d\n", ans[i]);
             }
         }
     }

     return ;
 }

离线版