【UOJ228】基础数据结构练习题（线段树）

Description

给定序列，要求资瓷区间加、区间开根、区间求和。

---

Solution

用线段树维护最大值、最小值、和。如果$\max - \sqrt{\max}=\min - \sqrt{\min}$，那么一起处理、打上区间减标记即可。

时间复杂度？？我太菜了，不知道。。。

---

Code

/**************************************
 * Au: Hany01
 * Prob: [UOJ228] 基础数据结构练习题
 * Date: Jul 31st, 2018
 * Email: hany01@foxmail.com
**************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)
#define rep(i, j) for (register int i = 0, i##_end_ = j; i < i##_end_; ++ i)
#define For(i, j ,k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define SZ(a) ((int)(a.size()))
#define ALL(a) a.begin(), a.end()
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define x first
#define y second
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define y1 wozenmezhemecaia 
#ifdef hany01
#define debug(...) fprintf(stderr, __VA_ARGS__)
#else
#define debug(...)
#endif

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read() {
    register char c_; register int _, __;
    for (_ = 0, __ = 1, c_ = getchar(); !isdigit(c_); c_ = getchar()) if (c_ == '-')  __ = -1;
    for ( ; isdigit(c_); c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

const int maxn = 1e5 + 5;

LL mn[maxn << 2], mx[maxn << 2], sm[maxn << 2], tag[maxn << 2];

#define lc (t << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)

inline void maintain(int t) {
    mn[t] = min(mn[lc], mn[rc]), mx[t] = max(mx[lc], mx[rc]), sm[t] = sm[lc] + sm[rc];
}

inline void pushdown(int t, int l, int r) {
    if (tag[t]) {
        tag[lc] += tag[t], tag[rc] += tag[t];
        sm[lc] += (LL)tag[t] * (mid - l + 1), sm[rc] += (LL)tag[t] * (r - mid);
        mn[lc] += tag[t], mn[rc] += tag[t], mx[lc] += tag[t], mx[rc] += tag[t];
        tag[t] = 0;
    }
}

inline void mark(int t, int l, int r, LL dt) {
    sm[t] += (r - l + 1) * dt, mn[t] += dt, mx[t] += dt, tag[t] += dt;
}

void build(int t, int l, int r) {
    if (l == r) mn[t] = mx[t] = sm[t] = read();
    else build(lc, l, mid), build(rc, mid + 1, r), maintain(t);
}

void update1(int t, int l, int r, int x, int y, int dt) {
    if (x <= l && r <= y) { mark(t, l, r, dt); return; }
    pushdown(t, l, r);
    if (x <= mid) update1(lc, l, mid, x, y, dt);
    if (y >  mid) update1(rc, mid + 1, r, x, y, dt);
    maintain(t);
}

void update2(int t, int l, int r, int x, int y) {
    if (x <= l && r <= y) {
        register LL tmp;
        if ((tmp = (mn[t] - (LL)floor(sqrt(mn[t])))) == mx[t] - (LL)floor(sqrt(mx[t]))) { mark(t, l, r, -tmp); return; }
    }
    pushdown(t, l, r);
    if (x <= mid) update2(lc, l, mid, x, y);
    if (y >  mid) update2(rc, mid + 1, r, x, y);
    maintain(t);
}

LL query(int t, int l, int r, int x, int y) {
    if (x <= l && r <= y) return sm[t];
    pushdown(t, l, r);
    if (y <= mid) return query(lc, l, mid, x, y);
    if (x >  mid) return query(rc, mid + 1, r, x, y);
    return query(lc, l, mid, x, y) + query(rc, mid + 1, r, x, y);
}

int main()
{
#ifdef hany01
    File("uoj228");
#endif

    static int n = read(), m = read(), ty, l, r, x;
    build(1, 1, n);
    while (m --) {
        ty = read(), l = read(), r = read();
        if (ty == 1) x = read(), update1(1, 1, n, l, r, x);
        else if (ty == 2) update2(1, 1, n, l, r);
        else printf("%lld\n", query(1, 1, n, l, r));
    }

    return 0;
}