题目链接
有四种查询的方式:
(C)、区间全体增加val值;
(Q)、查询现在状态的区间和;
(H)、查询历史T时刻的区间和;
(B)、时间戳回到T时刻。
那么就是可持久化线段树了(当然也可以用主席树的不断建立新边来写的说),关键是怎么传递信息,于是就用到了永久化标记……一开始过不了样例,一直在想哪里写错了,后来再推理了一遍,找到关键所在:
我们建立可持久化线段树,对于加新的边,就利用新的创建边,此时要继承之前的lazy[]标记,同时,要更新此时的tree[]传递,更新对应的tree[]值,用作之后的继承关系。
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define MP(a, b) make_pair(a, b)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 1e5 + 5;
int idx, root[maxN], lson[maxN*30], rson[maxN*30];
int N, M;
ll a[maxN], tree[maxN*30], lazy[maxN*30];
inline void pushup(int rt) { tree[rt] = tree[lson[rt]] + tree[rson[rt]]; }
void build_Tree(int &k, int l, int r)
{
k = ++idx;
if(l == r)
{
tree[k] = a[l];
return;
}
int mid = HalF;
build_Tree(lson[k], l, mid);
build_Tree(rson[k], mid + 1, r);
pushup(k);
}
void update(int old, int &k, int l, int r, int ql, int qr, int val)
{
k = ++idx;
lson[k] = lson[old]; rson[k] = rson[old]; lazy[k] = lazy[old]; tree[k] = tree[old] + val * (qr - ql + 1);
if(ql<=l && qr>=r)
{
lazy[k] += val;
return;
}
int mid = HalF;
if(qr <= mid) update(lson[old], lson[k], l, mid, ql, qr, val);
else if(ql > mid) update(rson[old], rson[k], mid + 1, r, ql, qr, val);
else
{
update(lson[old], lson[k], l, mid, ql, mid, val);
update(rson[old], rson[k], mid + 1, r, mid + 1, qr, val);
}
}
ll query(int rt, int l, int r, int ql, int qr)
{
if(ql <= l && qr >= r) return tree[rt];
int mid = HalF;
ll tmp = (qr - ql + 1) * lazy[rt];
if(qr <= mid) return query(lson[rt], l, mid, ql, qr) + tmp;
else if(ql > mid) return query(rson[rt], mid + 1, r, ql, qr) + tmp;
else return query(lson[rt], l, mid, ql, mid) + query(rson[rt], mid + 1, r, mid + 1, qr) + tmp;
}
inline void init()
{
idx = 0;
memset(lazy, 0, sizeof(lazy));
}
char op[3];
int main( )
{
while(scanf("%d%d", &N, &M)!=EOF)
{
init();
for(int i=1; i<=N; i++) scanf("%lld", &a[i]);
build_Tree(root[0], 1, N);
int titi = 0; //时间线
while(M--)
{
scanf("%s", op);
if(op[0] == 'C')
{
int l, r, val; scanf("%d%d%d", &l, &r, &val);
update(root[titi], root[titi + 1], 1, N, l, r, val);
titi++;
}
else if(op[0] == 'Q')
{
int l, r; scanf("%d%d", &l, &r);
printf("%lld\n", query(root[titi], 1, N, l, r));
}
else if(op[0] == 'H')
{
int l, r, t; scanf("%d%d%d", &l, &r, &t);
printf("%lld\n", query(root[t], 1, N, l, r));
}
else
{
int t; scanf("%d", &t);
titi = t;
}
}
}
return 0;
}