Can you answer these queries IV 【SPOJ - GSS4】【线段树 开根号处理】

题目链接

---

  也不是什么难题吧，只是有人看到时间可能不敢尝试吧，其实开根开多了之后就会达到一种稳态，所以，我们只需要找到平衡的时候，然后一起处理就可以节约超级多的时间复杂度了。

5
2 2 2 2 2
4
0 1 4
0 1 4
0 2 5
1 1 5
ans:5

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define efs 1e-6
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define max3(a, b, c) max(a, max(b, c))
#define max6(a, b, c, d, f, g) max(max3(a, b, c), max3(d, f, g))
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 1e5 + 7;
int N, M;
ll tree[maxN<<2], sum[maxN<<2];
inline void pushup(int rt)
{
    if(tree[lsn] == tree[rsn]) tree[rt] = tree[lsn];
    else tree[rt] = 0;
    sum[rt] = sum[lsn] + sum[rsn];
}
void buildTree(int rt, int l, int r)
{
    if(l == r)
    {
        scanf("%lld", &tree[rt]);
        sum[rt] = tree[rt];
        return;
    }
    int mid = HalF;
    buildTree(Lson); buildTree(Rson);
    pushup(rt);
}
inline void pushdown(int rt, int l, int r)
{
    if(tree[rt])
    {
        tree[lsn] = tree[rsn] = tree[rt];
        tree[rt] = 0;
        int mid = HalF;
        sum[lsn] = tree[lsn] * (mid - l + 1);
        sum[rsn] = tree[rsn] * (r - mid);
    }
}
void update(int rt, int l, int r, int ql, int qr)
{
    if(ql <= l && qr >= r && tree[rt])
    {
        tree[rt] = (ll)sqrt(1. * tree[rt] + efs);
        sum[rt] = tree[rt] * ( min(qr, r) - max(ql, l) + 1 );
        return;
    }
    pushdown(myself);
    int mid = HalF;
    if(ql <= mid) update(QL);
    if(qr > mid) update(QR);
    pushup(rt);
}
ll query(int rt, int l, int r, int ql, int qr)
{
    if(ql <= l && qr >= r) return sum[rt];
    if(tree[rt]) return tree[rt] * ( min(qr, r) - max(ql, l) + 1 );
    pushdown(myself);
    int mid = HalF;
    if(qr <= mid) return query(QL);
    else if(ql > mid) return query(QR);
    else return query(QL) + query(QR);
}
int main()
{
    int Cas = 0;
    while(scanf("%d", &N) != EOF)
    {
        buildTree(1, 1, N);
        scanf("%d", &M);
        int op, l, r;
        printf("Case #%d:\n", ++Cas);
        while(M--)
        {
            scanf("%d%d%d", &op, &l, &r);
            if(l > r) swap(l, r);
            if(op) printf("%lld\n", query(1, 1, N, l, r));
            else update(1, 1, N, l, r);
        }
        printf("\n");
    }
    return 0;
}