using ll=int;
class SegmentTree{
public:
const static int N=1e5+1,mod=1e9+7;
vector<ll> tree,markA,markB;
SegmentTree(){
tree.resize(N<<2,0),markA.resize(N<<2,1),markB.resize(N<<2,0);
}
void update(int idx, int left, int right, int lo, int hi, int val) {
if (left >= lo && right <= hi) {
if (val > 0) {
markB[idx] = (markB[idx] + val) % mod;
tree[idx] = (tree[idx] + val) % mod;
} else {
markA[idx] = (1LL*markA[idx] * -val) % mod;
markB[idx] = (1LL*markB[idx] * -val) % mod;
tree[idx] = (1LL*tree[idx] * -val) % mod;
}
return;
}
pushDown(idx, left, right);
int mid = left + ((right - left) >> 1);
if(lo<=mid) update(idx << 1, left, mid, lo, hi, val);
if(hi>mid) update(idx << 1 | 1, mid + 1, right, lo, hi, val);
}
int query(int idx, int left, int right, int lo, int hi) {
if (left >= lo && right <= hi)
return tree[idx];
pushDown(idx, left, right);
int mid = left + ((right - left) >> 1);
int sum=0;
if(lo<=mid) sum=query(idx << 1, left, mid, lo, hi);
if(hi>mid) sum=(sum+query(idx << 1 | 1, mid + 1, right, lo, hi))%mod;
return sum;
}
void pushDown(int idx, int left, int right) {
if (left <= right && (markA[idx] > 1 || markB[idx] > 0)) {
markA[idx << 1] = (1LL*markA[idx << 1] * markA[idx]) % mod;
markB[idx << 1] = (1LL*markB[idx << 1] * markA[idx] + markB[idx]) % mod;
tree[idx << 1]=(1LL*markA[idx]*tree[idx << 1]+markB[idx])%mod;
markA[idx << 1 | 1] = (1LL*markA[idx << 1 | 1] * markA[idx]) % mod;
markB[idx << 1 | 1] = (1LL*markB[idx << 1 | 1] * markA[idx] + markB[idx]) % mod;
tree[idx << 1|1]=(1LL*markA[idx]*tree[idx << 1|1]+markB[idx])%mod;
markA[idx] = 1;
markB[idx] = 0;
}
}
};
class Fancy {
public:
SegmentTree tree;
int size,n;
Fancy() {
size=0,n=1e5;
}
void append(int val) {
tree.update(1, 0, n - 1, size, size, val);
size++;
}
void addAll(int inc) {
if(size)tree.update(1, 0, n - 1, 0, size - 1, inc);
}
void multAll(int m) {
if(size)tree.update(1, 0, n - 1, 0, size - 1, -m);
}
int getIndex(int idx) {
return idx >= size ? -1 : tree.query(1, 0, n - 1, idx, idx);
}
};
LeetCode 1622 线段树懒标记板子题(c++)
于 2022-05-27 16:49:42 首次发布