LOJ #6029. 「雅禮集訓 2017 Day1」市場

題目連結：​​傳送門​​

有一個區間除法的操作

剛學線段樹的時候就好奇區間除法怎麼做

現在遇到了

#include <iostream>
#include <cstdio>
#include <cstring>
#include <complex>
#include <algorithm>
#include <climits>
#define
#define

using namespace std;
typedef long long ll;
struct node {int l, r; ll w, f, mx, mn;}tree[A];
int n, q, opt, l, r; ll c;
void up(int k) {
  tree[k].w = tree[k << 1].w + tree[k << 1 | 1].w;
  tree[k].mx = max(tree[k << 1].mx, tree[k << 1 | 1].mx);
  tree[k].mn = min(tree[k << 1].mn, tree[k << 1 | 1].mn);
}
void build(int k, int l, int r) {
  tree[k].l = l; tree[k].r = r;
  if (l == r) {
    scanf("%lld", &tree[k].w);
    tree[k].mx = tree[k].mn = tree[k].w;
    return;
  }
  int m = (l + r) >> 1;
  build(k << 1, l, m); build(k << 1 | 1, m + 1, r); up(k);
}
void down(int k) {
  tree[k << 1].f += tree[k].f; tree[k << 1 | 1].f += tree[k].f;
  tree[k << 1].mx += tree[k].f; tree[k << 1 | 1].mx += tree[k].f;
  tree[k << 1].mn += tree[k].f; tree[k << 1 | 1].mn += tree[k].f;
  tree[k << 1].w += (tree[k << 1].r - tree[k << 1].l + 1) * tree[k].f;
  tree[k << 1 | 1].w += (tree[k << 1 | 1].r - tree[k << 1 | 1].l + 1) * tree[k].f;
  tree[k].f = 0;
}
void add(int k, int l, int r, ll val) {
  if (tree[k].l >= l and tree[k].r <= r) {
    tree[k].w += (tree[k].r - tree[k].l + 1) * val;
    tree[k].mx += val; tree[k].mn += val; tree[k].f += val; return;
  }
  int m = (tree[k].l + tree[k].r) >> 1;
  if (tree[k].f) down(k);
  if (l <= m) add(k << 1, l, r, val);
  if (r > m) add(k << 1 | 1, l, r, val);
  up(k);
}
void divide(int k, int l, int r, double d) {
  if (tree[k].l >= l and tree[k].r <= r) {
    ll L = tree[k].mx - floor(double(tree[k].mx) / d);
    ll R = tree[k].mn - floor(double(tree[k].mn) / d);
    if (L == R) {
      tree[k].w -= (tree[k].r - tree[k].l + 1) * L;
      tree[k].mx -= L; tree[k].mn -= L; tree[k].f -= L; return;
    }
  }
  int m = (tree[k].l + tree[k].r) >> 1;
  if (tree[k].f) down(k);
  if (l <= m) divide(k << 1, l, r, d);
  if (r > m) divide(k << 1 | 1, l, r, d);
  up(k);
}
ll askmin(int k, int l, int r) {
  if (tree[k].l >= l and tree[k].r <= r) return tree[k].mn;
  int m = (tree[k].l + tree[k].r) >> 1; ll ans = INT_MAX;
  if (tree[k].f) down(k);
  if (l <= m) ans = min(ans, askmin(k << 1, l, r));
  if (r > m) ans = min(ans, askmin(k << 1 | 1, l, r));
  return ans;
}
ll asksum(int k, int l, int r) {
  if (tree[k].l >= l and tree[k].r <= r) return tree[k].w;
  int m = (tree[k].l + tree[k].r) >> 1; ll ans = 0;
  if (tree[k].f) down(k);
  if (l <= m) ans += asksum(k << 1, l, r);
  if (r > m) ans += asksum(k << 1 | 1, l, r);
  return ans;
}

int main(int argc, char const *argv[]) {
  cin >> n >> q; build(1, 1, n);
  while (q--) {
    scanf("%d%d%d", &opt, &l, &r); l++; r++;
    if (opt == 1 or opt == 2) scanf("%lld", &c);
    if (opt == 1) add(1, l, r, c);
    if (opt == 2) divide(1, l, r, (double)c);
    if (opt == 3) printf("%lld\n", askmin(1, l, r));
    if (opt == 4) printf("%lld\n", asksum(1, l, r));
  }
}