关于队里面最菜的在博客打卡第十四天这件事

今天遇到一道差分的板子题，然后就突发奇想，能不能不用差分去写这道题哈哈，结果搞了好一阵发现用线段树的懒标记，并且不需要pushup并且最后再伪build一下就可以过哈哈

题目链接：Hcode OnlineJudge

题目就是一道差分的板子题

然后用一个神奇的线段树的神奇的写法就可以写出来（不要问我为什么不用差分

以下是代码

#include <iostream>
using namespace std;
const int N = 1e6 + 10;
long long int a[N];
struct node
{
    int l, r;
    long long int sum;
    int lan;
} tr[N * 4];
void pushdown(int u)
{
    if (tr[u].lan)
    {
        if (u << 1 <= N * 4)
            tr[u << 1].sum += (tr[u << 1].r - tr[u << 1].l + 1) * tr[u].lan, tr[u << 1].lan += tr[u].lan;
        if (u << 1 | 1 <= N * 4)
            tr[u << 1 | 1].sum += (tr[u << 1 | 1].r - tr[u << 1 | 1].l + 1) * tr[u].lan, tr[u << 1 | 1].lan += tr[u].lan;
        tr[u].lan = 0;
    }
}
void build(int u, int l, int r)
{
    if (l == r)
        tr[u] = {l, r, a[l], 0};
    else
    {
        tr[u] = {l, r};
        int mid = l + r >> 1;
        build(u << 1, l, mid);
        build(u << 1 | 1, mid + 1, r);
    }
}
void modify(int u, int l, int r, long long int v)
{
    if (l <= tr[u].l && tr[u].r <= r)
    {
        tr[u].sum += (tr[u].r - tr[u].l + 1) * v;
        tr[u].lan += v;
    }
    else
    {
        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);
    }
}
void find(int u, int l, int r)
{
    if (l == r)
        a[l] = tr[u].sum;
    else
    {
        pushdown(u);
        int mid = l + r >> 1;
        find(u << 1, l, mid);
        find(u << 1 | 1, mid + 1, r);
    }
}
int main()
{
    ios ::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    build(1, 1, n);
    int l, r, v;
    while (m--)
    {
        cin >> l >> r >> v;
        modify(1, l, r, v);
    }
    long long int maxd = 1e17 + 10;
    find(1, 1, n);
    for (int i = 1; i <= n; i++)
        maxd = (maxd < a[i] ? maxd : a[i]);
    cout << maxd << endl;
}