AcWing 3805. 环形数组

第 12 场周赛

题目链接

线段树

• 区间更改
• 求区间最小值
  yxc视频讲解

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;
using LL = long long;
const LL INF = 1e18;
const int N = 2e5+10;
int a[N];
int n, m;
struct Node
{
    int l, r;
    LL dt, minv;
    // TODO: 需要维护的信息和懒标记
}tr[N * 4];

void pushup(int u)
{
    auto &root = tr[u], &left = tr[u<<1], &right = tr[u<<1|1];
    root.minv = min(left.minv, right.minv);
    // TODO: 利用左右儿子信息维护当前节点的信息
}

void pushdown(int u)
{
    auto &root = tr[u], &left = tr[u<<1], &right = tr[u<<1|1];
    left.dt += root.dt; left.minv += root.dt;
    right.dt += root.dt; right.minv += root.dt;
    root.dt = 0;
    // TODO: 将懒标记下传
}

void build(int u, int l, int r)
{
    if (l == r) tr[u] = {l, r, 0, a[l]};
    else
    {
        tr[u] = {l, r};
        int mid = l + r >> 1;
        build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
        pushup(u);
    }
}

void update(int u, int l, int r, int d)
{
    if (tr[u].l >= l && tr[u].r <= r)
    {
        // TODO: 修改区间
        tr[u].dt += d;
        tr[u].minv += d;
    }
    else
    {
        pushdown(u);
        int mid = tr[u].l + tr[u].r >> 1;
        if (l <= mid) update(u << 1, l, r, d);
        if (r > mid) update(u << 1 | 1, l, r, d);
        pushup(u);
    }
}

LL query(int u, int l, int r)
{
    if (tr[u].l >= l && tr[u].r <= r)
    {
        return tr[u].minv;  // TODO 需要补充返回值
    }
    else
    {
        pushdown(u);
        int mid = tr[u].l + tr[u].r >> 1;
        LL res = INF;
        if (l <= mid ) res = query(u << 1, l, r);
        if (r > mid) res = min(res, query(u << 1 | 1, l, r));
        return res;
    }
}

int main()
{
    scanf("%d", &n);
    for (int i = 1; i <= n; i ++ ) scanf("%d", &a[i]);
    build(1, 1, n);
    int m;
    scanf("%d", &m);
    int l, r, d;
    char c;
    while (m -- ){
        scanf("%d %d%c", &l, &r, &c);
        l++;
        r++;
        if(c==' ') {
            scanf("%d", &d);
            
            if(l <= r) update(1, l, r, d);
            else{
                update(1, l, n, d);
                update(1, 1, r, d);
            }
        }else{
            if(l <= r) printf("%lld\n", query(1, l, r));
            else printf("%lld\n", min(query(1, l, n), query(1,1, r)));
        }
        
    }
    return 0;
}