EOJ3392. 线段树：区间覆盖

EOJ3392. 线段树：区间覆盖

原题链接：https://acm.ecnu.edu.cn/problem/3392/

区间操作的问题可以在线段树上增加懒标记解决

#include <iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#define INF 0x3f3f3f3f
using namespace std;
const int N = 5e5 + 5;
typedef long long ll;
struct Node {
    int l, r;
    ll sum;//求和数据可能爆int
    ll cd;//懒标记
}tr[N * 4];
void pushup(int u)
{
    tr[u].sum = tr[u << 1].sum + tr[u << 1 | 1].sum;
    //左右子树求和
}
void pushdown(int u)
{
    if (tr[u].cd != INF)//不等于INF代表该结点带有懒标记
    {
        tr[u << 1].cd = tr[u].cd;//懒标记传给左孩子
        tr[u << 1].sum = (ll)(tr[u << 1].r - tr[u << 1].l + 1) * tr[u].cd;
        //和等于区间点的个数*值
        tr[u << 1 | 1].cd = tr[u].cd;//懒标记传给右孩子
        tr[u << 1 | 1].sum = (ll)(tr[u << 1 | 1].r - tr[u << 1 | 1].l + 1) * tr[u].cd;
        tr[u].cd = INF;//取消当前结点的懒标记
    }
}
void build(int u, int l, int r)//建树
{
    tr[u].l = l;
    tr[u].r = r;
    tr[u].cd = 0;
    tr[u].sum = 0;
    if (l == r) return;
    int mid = l + r >> 1;
    build(u << 1, l, mid);
    build(u << 1 | 1, mid + 1, r);
}

ll query(int u, int l, int r)//查询区间和
{
    if (tr[u].l >= l && tr[u].r <= r)
    {
        return tr[u].sum;
    }
    pushdown(u);//查询时传递懒标记
    int mid = tr[u].l + tr[u].r >> 1;
    ll sum = 0;//求左右区间和
    if (l <= mid) sum = query(u << 1, l, r);
    if (r > mid) sum += query(u << 1 | 1, l, r);
    return sum;
}


void modify(int u, int l, int r, int v)
{
    if (tr[u].l >= l && tr[u].r <= r)
    {
        tr[u].sum = (ll)(tr[u].r - tr[u].l + 1) * v;
        tr[u].cd = (ll)v;       
    }
    else
    {
        pushdown(u);
        int mid = tr[u].l + tr[u].r >> 1;
        if (l <= mid) modify(u << 1, l, r, v);
        if (r > mid) modify(u << 1 | 1, l, r, v);
        pushup(u);//u的孩子发生变化，更新u
    }
}
int main()
{
    int n = 0, m = 0;
    scanf("%d", &n);
    build(1, 1, n);
    int x, d, l, r;
    for (int i = 1; i <= n; i++)
    {
        scanf("%d", &x);
        modify(1, i, i, x);
    }
    scanf("%d", &m);
    while (m--)
    {
        char op[2];
        scanf("%s", op);
        if (op[0] == '1')
        {
            scanf("%d%d%d", &l, &r, &d);
            modify(1, l, r, d);
        }
        else
        {
            scanf("%d%d", &l, &r);
            printf("%lld\n", query(1, l, r));
        }
    }
    return 0;
}

下面是另一道相似题目，可以采用同样的办法解决

3391. 线段树：区间增加

原题链接：https://acm.ecnu.edu.cn/problem/3391/

#include <iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#define INF 0x3f3f3f3f

using namespace std;
const int N = 5e5 + 5;
typedef long long ll;
int a[N];
struct Node {
    int l, r;
    ll sum;//求和数据可能爆int
    ll add;//懒标记
}tr[N * 4];

void pushup(int u)
{
    tr[u].sum = tr[u << 1].sum + tr[u << 1 | 1].sum;
    //左右子树求和
}
void pushdown(int u)
{
    //不等于0代表有懒标记，因为整个区间都要加上add
    if (tr[u].add != 0)
    {
        tr[u << 1].add += tr[u].add;//注意这里是 +=
        tr[u << 1].sum += (ll)(tr[u << 1].r - tr[u << 1].l + 1) * tr[u].add;
        tr[u << 1 | 1].add += tr[u].add;
        tr[u << 1 | 1].sum += (ll)(tr[u << 1 | 1].r - tr[u << 1 | 1].l + 1) * tr[u].add;
        tr[u].add = 0;
    }
}
void build(int u, int l, int r)//建树
{
    tr[u].l = l;
    tr[u].r = r;
    tr[u].add = 0;
    tr[u].sum = 0;
    if (l == r) return;
    int mid = l + r >> 1;
    build(u << 1, l, mid);
    build(u << 1 | 1, mid + 1, r);
}

ll query(int u, int l, int r)//查询区间和
{
    if (tr[u].l >= l && tr[u].r <= r)
    {
        return tr[u].sum;
    }
    pushdown(u);
    int mid = tr[u].l + tr[u].r >> 1;
    ll sum = 0;
    if (l <= mid) sum = query(u << 1, l, r);
    if (r > mid) sum += query(u << 1 | 1, l, r);
    return sum;
}


void modify(int u, int l, int r, int v)
{

    if (tr[u].l >= l && tr[u].r <= r)
    {
        tr[u].sum += (ll)(tr[u].r - tr[u].l + 1) * v;
        tr[u].add += (ll)v;       
    }
    else
    {
        pushdown(u);
        int mid = tr[u].l + tr[u].r >> 1;
        if (l <= mid) modify(u << 1, l, r, v);
        if (r > mid) modify(u << 1 | 1, l, r, v);
        pushup(u);//u的孩子发生变化，更新u
    }
}
int main()
{
    int n = 0, m = 0;
    scanf("%d", &n);
    build(1, 1, n);
    int x, d, l, r;
    for (int i = 1; i <= n; i++)
    {
        scanf("%d", &x);
        modify(1, i, i, x);
    }
    scanf("%d", &m);
    while (m--)
    {
        char op[2];
        scanf("%s", op);
        if (op[0] == '1')
        {
            scanf("%d%d%d", &l, &r, &d);
            modify(1, l, r, d);
        }
        else
        {
            scanf("%d%d", &l, &r);
            printf("%lld\n", query(1, l, r));
        }
    }
    return 0;
}