线段树特训

此处只讲一个，既有区间赋值操作，又有区间加值操作的线段树编写

其需要创建两种懒节点，并需要设置优先级

例题1：【模板】线段树 1 - 洛谷

示例代码：

#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 1e5 + 10;
int n, m;
int d[4 * N], a[N], b[4 * N];

void build(int s, int t, int p) {
  if (s == t) {
    d[p] = a[s];
    return;
  }
  int m = (s + t) / 2;
  build(s, m, 2 * p);
  build(m + 1, t, 2 * p + 1);
  d[p] = d[2 * p] + d[2 * p + 1];
}

void update(int l, int r, int c, int s, int t, int p) {
  if (l <= s && t <= r) {
    d[p] += (t - s + 1) * c, b[p] += c;  // 如果区间被包含了，直接得出答案
    return;
  }
  int m = s + ((t - s) >> 1);
  if (b[p])
    d[2 * p] += b[p] * (m - s + 1), d[2 * p + 1] += b[p] * (t - m),
        b[2 * p] += b[p], b[2 * p + 1] += b[p];
  b[p] = 0;
  if (l <= m)
    update(l, r, c, s, m, 2 * p);  // 本行和下面的一行用来更新p*2和p*2+1的节点
  if (r > m) update(l, r, c, m + 1, t, 2 * p + 1);
  d[p] = d[p << 1] + d[(p << 1) | 1];  // 计算该节点区间和
}

int getsum(int l, int r, int s, int t, int p) {
  if (l <= s && t <= r) return d[p];
  int m = (s + t) / 2;
  if (b[p]) {
    d[2 * p] += b[p] * (m - s + 1);
    d[2 * p + 1] += b[p] * (t - m);
    b[2 * p] += b[p];
    b[2 * p + 1] += b[p];
    b[p] = 0;
  }
  int sum = 0;
  if (l <= m) sum += getsum(l, r, s, m, 2 * p);
  if (r > m) sum += getsum(l, r, m + 1, t, 2 * p + 1);
  return sum;
}

signed main() {
  cin >> n >> m;

  for (int i = 1; i <= n; i++) cin >> a[i];

  build(1, n, 1);

  while (m--) {
    int t, x, y, k;
    cin >> t >> x >> y;
    if (t == 1) {
      cin >> k;

      update(x, y, k, 1, n, 1);
      continue;
    }

    cout << getsum(x, y, 1, n, 1) << endl;
    ;
  }
}

例题2：【模板】线段树 2 - 洛谷

例题3：线段树的区间修改 - HihoCoder 1078 - Virtual Judge

#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 1e5 + 10;
int n, m;
int d[4 * N], a[N], b[4 * N];

void build(int s, int t, int p) {
  if (s == t) {
    d[p] = a[s];
    return;
  }
  int m = (s + t) / 2;
  build(s, m, 2 * p);
  build(m + 1, t, 2 * p + 1);
  d[p] = d[2 * p] + d[2 * p + 1];
}

void update(int l, int r, int c, int s, int t, int p) {
  if (l <= s && t <= r) {
    d[p] += (t - s + 1) * c, b[p] = c;  // 如果区间被包含了，直接得出答案
    return;
  }
  int m = s + ((t - s) >> 1);
  if (b[p]) {
    d[2 * p] = b[p] * (m - s + 1), d[2 * p + 1] = b[p] * (t - m),
          b[2 * p] = b[p], b[2 * p + 1] = b[p];
    b[p] = 0;
  }

  if (l <= m)
    update(l, r, c, s, m, 2 * p);  // 本行和下面的一行用来更新p*2和p*2+1的节点
  if (r > m) update(l, r, c, m + 1, t, 2 * p + 1);
  d[p] = d[2 * p] + d[2 * p + 1];  // 计算该节点区间和
}

int getsum(int l, int r, int s, int t, int p) {
  if (l <= s && t <= r) return d[p];
  int m = (s + t) / 2;
  if (b[p]) {
    d[2 * p] = b[p] * (m - s + 1);
    d[2 * p + 1] = b[p] * (t - m);
    b[2 * p] = b[p];
    b[2 * p + 1] = b[p];
    b[p] = 0;
  }
  int sum = 0;
  if (l <= m) sum += getsum(l, r, s, m, 2 * p);
  if (r > m) sum += getsum(l, r, m + 1, t, 2 * p + 1);
  return sum;
}

signed main() {
  cin >> n >> m;

  for (int i = 1; i <= n; i++) cin >> a[i];

  build(1, n, 1);

  while (m--) {
    int t, x, y, k;
    cin >> t >> x >> y;
    if (t == 1) {
      cin >> k;

      update(x, y, k, 1, n, 1);
      continue;
    }

    cout << getsum(x, y, 1, n, 1) << endl;
    ;
  }
}

例题4：Problem - 6356