EOJ3390. 线段树：点覆盖

EOJ3390. 线段树：点覆盖

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

数据规模比较大，采用暴力做法会超时，如题目所述使用线段树

#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
    //利用sum也能够存储某点初始值
    int min;
    int max;
}tr[N * 4];

void pushup(int u)
{
    tr[u].max = max(tr[u << 1].max, tr[u << 1 | 1].max);
    //找左右子树最大值
    tr[u].min = min(tr[u << 1].min, tr[u << 1 | 1].min);
    //找左右子树最小值
    tr[u].sum = tr[u << 1].sum+tr[u << 1 | 1].sum;
    //左右子树求和
}

void build(int u, int l, int r)//建树
{
    tr[u].l = l;
    tr[u].r = r;
    if (l == r) return;
    int mid = l + r >> 1;
    build(u << 1, l, mid);
    build(u << 1 | 1, mid + 1, r);
}

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

int query2(int u, int l, int r)//查询区间最大值
{
    if (tr[u].l >= l && tr[u].r <= r)
    {
        return tr[u].max;
    }
    int mid = tr[u].l + tr[u].r >> 1;
    int m = -0x3f3f3f3f;
    if (l <= mid) m = query2(u << 1, l, r);
    if (r > mid) m = max(m, query2(u << 1 | 1, l, r));
    return m;
}

int query3(int u, int l, int r)//查询区间最小值
{
    if (tr[u].l >= l && tr[u].r <= r)
    {
        return tr[u].min;
    }
    int mid = tr[u].l + tr[u].r >> 1;
    int m = 0x3f3f3f3f;
    if (l <= mid) m = query3(u << 1, l, r);
    if (r > mid) m = min(m, query3(u << 1 | 1, l, r));
    return m;
}

void modify(int u, int x, int v)
{
    if (tr[u].l == x && tr[u].r == x)
    {
        tr[u].sum = (ll)v;
        tr[u].max = v;
        tr[u].min = v;
    }
    else
    {
        int mid = tr[u].l + tr[u].r >> 1;
        if (x <= mid) modify(u << 1, x, v);
        else modify(u << 1 | 1, x, v);
        pushup(u);//u的孩子发生变化，更新u
    }
}
int main()
{
    int n = 0, q = 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, x);
    }
    scanf("%d", &q);
    while (q--)
    {
        int op;
        scanf("%d", &op);
        if (op == 1)
        {
            scanf("%d%d", &x, &d);
            modify(1, x, d);
        }
        else
        {
            scanf("%d%d", &l, &r);
            printf("%lld ", query1(1, l, r));
            printf("%d ", query2(1, l, r));
            printf("%d\n", query3(1, l, r));
        }
    }    
    return 0;
}

代码稍加修改一下，可以通过下面一道比较相似的题目

EOJ3389. 线段树：点增加

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

#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;

}tr[N * 4];
void pushup(int u)
{ 
    tr[u].sum = tr[u << 1].sum+tr[u << 1 | 1].sum;
}
void build(int u, int l, int r)
{
    tr[u].l = l;
    tr[u].r = r;
    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;
    }
    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 x, int v)
{
    if (tr[u].l == x && tr[u].r == x)
    {
        tr[u].sum += (ll)v;
    }
    else
    {
        int mid = tr[u].l + tr[u].r >> 1;
        if (x <= mid) modify(u << 1, x, v);
        else modify(u << 1 | 1, x, v);
        pushup(u);
    }
}
int main()
{
    int n = 0, q = 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, x);
    }
    scanf("%d", &q);
    while (q--)
    {
        int op;
        scanf("%d", &op);
        if (op == 1)
        {
            scanf("%d%d", &x, &d);
            modify(1, x, d);
        }
        else
        {
            scanf("%d%d", &l, &r);
            printf("%lld\n", query(1, l, r));
        }
    }    
    return 0;
}