HDU 4348 To the moon 可持久化线段树

To the moon

Problem Description

Background
To The Moon is a independent game released in November 2011, it is a role-playing adventure game powered by RPG Maker.
The premise of To The Moon is based around a technology that allows us to permanently reconstruct the memory on dying man. In this problem, we'll give you a chance, to implement the logic behind the scene.

You‘ve been given N integers A_[1], A_[2],..., A_[N]. On these integers, you need to implement the following operations:
1. C l r d: Adding a constant d for every {A_i | l <= i <= r}, and increase the time stamp by 1, this is the only operation that will cause the time stamp increase. 
2. Q l r: Querying the current sum of {A_i | l <= i <= r}.
3. H l r t: Querying a history sum of {A_i | l <= i <= r} in time t.
4. B t: Back to time t. And once you decide return to a past, you can never be access to a forward edition anymore.
.. N, M ≤ 10⁵, |A_[i]| ≤ 10⁹, 1 ≤ l ≤ r ≤ N, |d| ≤ 10⁴ .. the system start from time 0, and the first modification is in time 1, t ≥ 0, and won't introduce you to a future state.

 

Input

n m
A₁ A₂ ... A_n
... (here following the m operations. )

 

Output

... (for each query, simply print the result. )

 

Sample Input

10 5
1 2 3 4 5 6 7 8 9 10
Q 4 4
Q 1 10
Q 2 4
C 3 6 3
Q 2 4

2 4
0 0
C 1 1 1
C 2 2 -1
Q 1 2
H 1 2 1

 

Sample Output

4
55
9
15

0
1

 

 

题意：

　　 

　　给你一个数组，让你维护，m次操作

　　询问当前时刻一个区间的和

　　询问在t时刻的一个区间的和

　　回到t时刻

　　时间+1，在此时刻+1下更新一个区间的值

 

题解：

　　

　　函数式线段树的裸体

 

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 5e6+, M = 1e3+, mod = , inf = 1e9+;
typedef long long ll;

int n,m;
int l[N],r[N],root[N],add[N],tot = ;
ll sum[N];
int build(int s,int t) {
    int now = ++tot;
    add[now] = ;
    if(s==t) {
        scanf("%lld",&sum[now]);
        l[now] = r[now] = ;
        return now;
    }
    int mid = (s+t)>>;
    l[now] = build(s,mid);
    r[now] = build(mid+,t);
    sum[now] = sum[l[now]]+sum[r[now]];
    return now;
}
//查询在以t为根内[ll,rr]区间的值
ll query(int k,int lll,int rr,int s,int t) {
    ll ans = (add[k]*(rr-lll+));
    if(lll==s&&rr==t) return sum[k];
    int mid = (s+t)>>;
    if(rr<=mid) ans+=query(l[k],lll,rr,s,mid);
    else if(lll>mid) ans+=query(r[k],lll,rr,mid+,t);
    else {
        ans+=query(l[k],lll,mid,s,mid);
        ans+=query(r[k],mid+,rr,mid+,t);
    }
    return ans;
}
int update(int k,int lll,int rr,int d,int s,int t) {
    int now = ++tot;
    l[now] = l[k];
    r[now] = r[k];
    add[now] = add[k];
    sum[now] = sum[k];
    sum[now]+=(ll) (d*(rr-lll+));
    if(lll==s&&rr==t) {
        add[now]+=d;
        return now;
    }
    int mid = (s+t)>>;
    if(rr<=mid) l[now] = update(l[k],lll,rr,d,s,mid);
    else if(lll>mid) r[now] = update(r[k],lll,rr,d,mid+,t);
    else {
        l[now] = update(l[k],lll,mid,d,s,mid);
        r[now] = update(r[k],mid+,rr,d,mid+,t);
    }
    return now;
}
void solve() {
    tot = ;
    root[] = build(,n);
    int now = ;
    for(int i=;i<=m;i++) {
        char ch[];
        scanf("%s",ch);
        if(ch[]=='Q') {
                int a,b;
            scanf("%d%d",&a,&b);
            printf("%lld\n",query(root[now],a,b,,n));
        }
        else if(ch[]=='C') {
                int a,b,d;
            scanf("%d%d%d",&a,&b,&d);
            root[now+] = update(root[now],a,b,d,,n);
            now++;
        }
        else if(ch[]=='H') {
                int a,b,t;
            scanf("%d%d%d",&a,&b,&t);
            printf("%lld\n",query(root[t],a,b,,n));
        }
        else scanf("%d",&now);
    }
}
int main() {
    while(scanf("%d%d",&n,&m)!=EOF) {
        solve();
    }
    return ;
}