BZOJ 3211 花神游历各国 线段树 / 树状数组+并查集

题目链接

题意

两种操作
1. 对一段区间开方
2. 询问区间和

思路

这道题最关键的地方就是注意到 开方 操作进行几次后数字就变成了 $1$（或者有的一开始就为 $0$），之后的操作都是没有意义的了

线段树

用一个 $flag$ 标记这段区间是否全部 $\leq 1$，如果是的话就没有必要继续往下修改了。

Code

#include <bits/stdc++.h>
#define maxn 100010
#define lson (rt << 1)
#define rson (rt << 1 | 1)
typedef long long LL;
struct node {
    int l, r;
    bool flag;
    LL sum;
}tr[maxn * 4];
inline void push_up(int rt) {
    tr[rt].sum = tr[lson].sum + tr[rson].sum;
    tr[rt].flag = tr[lson].flag & tr[rson].flag;
}
inline int midi(int a, int b) { return a + b >> 1; }
void build(int rt, int l, int r) {
    tr[rt].l = l, tr[rt].r = r, tr[rt].flag = 0;
    if (l == r) {
        scanf("%lld", &tr[rt].sum);
        if (tr[rt].sum == 0 || tr[rt].sum == 1) tr[rt].flag = 1;
        return;
    }
    int mid = midi(l,r);
    build(lson, l, mid);
    build(rson, mid + 1, r);
    push_up(rt);
}
void modify(int rt, int l, int r) {
    if (tr[rt].flag) return;
    if (tr[rt].l == tr[rt].r) {
        tr[rt].sum = sqrt(tr[rt].sum);
        if (tr[rt].sum == 1 || tr[rt].sum == 0) tr[rt].flag = 1;
        return;
    }
    int mid = midi(tr[rt].l, tr[rt].r);
    if (r <= mid) modify(lson, l, r);
    else if (l > mid) modify(rson, l, r);
    else { modify(lson, l, mid); modify(rson, mid + 1, r); }
    push_up(rt);
}
LL query(int rt, int l, int r) {
    if (tr[rt].l == l && tr[rt].r == r) return tr[rt].sum;
    int mid = midi(tr[rt].l, tr[rt].r);
    if (r <= mid) return query(lson, l, r);
    else if (l > mid) return query(rson, l, r);
    else return query(lson, l, mid) + query(rson, mid + 1, r);
}
int n, q;
void work() {
    build(1, 1, n);
    scanf("%d", &q);
    while (q--) {
        int x, l, r;
        scanf("%d%d%d",&x,&l,&r);
        if (x == 1) printf("%lld\n", query(1, l, r));
        else modify(1, l, r);
    }
}
int main() {
    while (scanf("%d", &n) != EOF) work();
    return 0;
}

树状数组 + 并查集

参考：wzq_QWQ
用 $fa[i]$ 表示下标 $\geq i$ 的第一个 $\geq 1$ 的数的下标，形象一点说就是沿着这个指针往后跳。

Code

#include <bits/stdc++.h>
#define maxn 100010
typedef long long LL;
LL a[maxn], c[maxn];
int n, q, fa[maxn];
inline int lowbit(int x) { return x & (-x); }
inline LL query(int x) { LL ret = 0; while (x) ret += c[x], x -= lowbit(x); return ret; }
inline void modify(int x, LL y) { while (x <= n) c[x] += y, x += lowbit(x); }
inline int find(int x) { return fa[x] == x ? x : (fa[x] = find(fa[x])); }
void work() {
    memset(c, 0, sizeof(c));
    for (int i = 1; i <= n; ++i) {
        scanf("%lld", &a[i]);
        modify(i, a[i]);
        fa[i] = i;
    }
    fa[n+1] = n + 1;
    for (int i = 1; i <= n; ++i) if (fa[i] <= 1) fa[i] = find(i);
    scanf("%d", &q);
    while (q--) {
        int x, l, r;
        scanf("%d%d%d",&x,&l,&r);
        if (x == 1) printf("%lld\n", query(r) - query(l - 1));
        else for (int i = find(l); i <= r; i = find(i + 1)) {
            modify(i, (LL)sqrt(a[i])-a[i]);
            if ((a[i] = (LL)sqrt(a[i])) <= 1) fa[i] = find(i + 1);
        }
    }
}
int main() {
    while (scanf("%d", &n) != EOF) work();
    return 0;
}