2022江西icpc省赛k-Peach Conference

 输入样例：

10 8
1 1 10
0 4 6
2 3 6
0 4 5
-2 5 8
0 4 7
-2 4 5
0 3 5

输出：

3
6
5
4 

题目大意：一个数组a[],初始化为0，m个输入，格式为：x,y,z；如果x为0，输出数组【l,r】区间和，否则，对[y,z]区间每一个数进行+x操作（x可能为负数），如果a[i]<0,则令a[i]=0；

思路：线段树+lazy，lazy标记下放的时候判断可不可以一次性对区间加减，如果不可以，继续下放

#include<iostream>
#include<bits/stdc++.h>
#define ll long long
using namespace std;
#define endl '\n'
#define ls (o<<1)
#define rs (o<<1|1)
#define mid (l+r>>1)
inline ll read() {
    ll s = 0; bool w = true;
    char c = getchar();
    for (; c < '0' || c>'9'; c = getchar())if (c == '-')w = false;
    for (; c >= '0' && c <= '9'; c = getchar())s = (s << 1) + (s << 3) + (c ^ 48);
    return w ? s : -s;
}
const int N = 2e5 + 10;
ll s[N << 2], lz[N << 2],m[N<<2];//s存放1的个数，lz为lazy标记（不用lazy会超时），m代表区间最小数
string ss;
inline void build(ll o, ll l, ll r) {//建树
    lz[o] = 0;
    if (l == r) {
        s[o] = 0;
        return;
    }
    build(ls, l, mid);
    build(rs, mid + 1, r);
    s[o] = (s[ls] + s[rs]);
}
inline void pd(ll o, ll l, ll r) {//懒标记下传,
   // cout << "pd="<<o <<' '<<l<<" "<<r << endl;
    if (l >=r)return;
    if (m[ls] +lz[o]>=0) {
        m[ls] += lz[o];
        lz[ls] += lz[o];
        s[ls] += lz[o]*(mid-l+1);
    }
    else { pd(ls, l, mid); s[o] = (s[ls] + s[rs]);
    }
    if (m[rs] + lz[o]>=0) {
        m[rs] += lz[o];
        lz[rs] += lz[o];
        s[rs] += lz[o] * (r-mid);
    }
    else { pd(rs, mid+1, r); s[o] = (s[ls] + s[rs]);
    }
    lz[o] = 0;
}
inline void ud(ll o, ll l, ll r, ll ql, ll qr,ll c) {//更新操作
    //cout << "ud="<<l<<' '<<r<<" "<<ql<<' '<<qr << endl;
    if ( ql <= l && r <= qr) {
        if (m[o] +c>=0) {
            lz[o] += c;
            s[o] += (r - l + 1) * c;
            m[o] += c;
            return;
       }
        if (l == r) {
            lz[o] = 0;
            s[o] = 0;
            m[o] = 0;
            return;
        }
    }
    pd(o, l, r); 
    if (ql <= mid)ud(ls, l, mid, ql, qr,c);
    if (qr > mid)ud(rs, mid + 1, r, ql, qr,c);
    s[o] = s[ls] + s[rs];
    m[o] = min(m[ls], m[rs]);
}
inline ll query(ll o, ll l, ll r, ll ql, ll qr) {
    if (lz[o])pd(o, l, r);
    if (ql <= l && r <= qr)return s[o];
    ll sum = 0;
    if(ql<=mid)sum += query(ls, l, mid, ql, qr);
    if(mid<qr)sum+=query(rs, mid + 1, r, ql, qr);
    return sum;
}
void solve() {
    ll n = read(), w = read();
   // build(1, 1, n);
    for (int i = 1; i <= w; ++i) {
        ll x = read(), y = read(), z = read();

        if (x == 0) {
            cout << query(1, 1, n, y, z) << endl;
        }
        //else if (x < 0)ud(1, 1, n, y, z, x);
        else ud(1, 1, n, y, z, x);
    }

}
signed main() {
    ll T = 1;
    while (T--) {
        solve();
    }
    return 0;
}