整理的算法模板合集: ACM模板
懒惰标记
一行序列,每次操作把一个区间里的每个数都加上一个数,或者查询一个区间的和。
typedef long long ll;
const int N = 500010;
int n, m;
int a[N];
struct Tree{
int l, r;
ll sum;
ll lz;
}tr[N * 4];
void pushup(int p){
tr[p].sum = tr[p << 1].sum + tr[p << 1 | 1].sum;
}
void pushdown(int p){
auto &root = tr[p], &left = tr[p << 1], &right = tr[p << 1 | 1];
if(root.lz){
left.lz += root.lz;
left.sum += (ll)(left.r - left.l + 1) * root.lz;
right.lz += root.lz;
right.sum += (ll)(right.r - right.l + 1) * root.lz;
root.lz = 0;
}
}
void build(int p, int l, int r){
tr[p] = {
l, r};
if(l == r){
tr[p] = {
l, r, a[r], 0};
return ;
}
int mid = l + r >> 1;
build(p << 1, l, mid);
build(p << 1 | 1, mid + 1, r);
pushup(p);
}
void modify(int p, int l, int r, int v){
if(tr[p].l >= l && tr[p].r <= r){
tr[p].sum += (tr[p].r - tr[p].l + 1) * v;
tr[p].lz += v;
return ;
}
pushdown(p);
int mid = tr[p].l + tr[p].r >> 1;
if(l <= mid)modify(p << 1, l, r, v);
if(r > mid)modify(p << 1 | 1, l, r, v);
pushup(p);
}
ll query(int p, int l, int r){
if(tr[p].l >= l && tr[p].r <= r)
return tr[p].sum;
pushdown(p);//要在前面pushdown!
int mid = tr[p].l + tr[p].r >> 1;
ll res = 0;
if(l <= mid)res = query(p << 1, l, r);
if(r > mid)res += query(p << 1 | 1, l, r);
return res;
}
int main(){
scanf("%d%d", &n, &m);
for(int i = 1; i <= n ;++ i)scanf("%d", &a[i]);
build(1, 1, n);
while(m -- ){
char op[2];
int l, r, d;
scanf("%s%d%d", op, &l, &r);
if(*op == 'C'){
scanf("%d", &d);
modify(1, l, r, d);
}
else printf("%lld\n", query(1, l, r));
}
return 0;
}
给你一个序列,支持三种操作:一个区间上所有的数乘以k,一个区间上所有的数加上k,求区间和膜掉mod。
typedef long long ll;
const int N = 500007,INF = 0x3f3f3f3f;
int n, m, mod;
int a[N];
struct Tree{
int l, r;
int sum;
int mul, add;
}tr[N * 4];
inline void eval(Tree &t, int mul, int add){
//先乘后加//evaluate v.评估
t.sum = ((ll)t.sum * mul + (ll)(t.r - t.l + 1) * add) % mod;
t.mul = ((ll)t.mul * mul) % mod;
t.add = ((ll)t.add * mul + add) % mod;
}
inline void pushdown(int p){
eval(tr[p << 1], tr[p].mul, tr[p].add);
eval(tr[p << 1 | 1], tr[p].mul, tr[p].add);
tr[p