hdu 4027 Can you answer these queries?

线段树。

1、成段更新。每次把区间的每个值都变为它的平方根（如果区间都是一就不用再更新下去了）。

2、区间求和。

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1

typedef __int64 ll;
const int maxn = 100010;
ll sum[maxn<<2];
ll len[maxn<<2];

void PushUp(int rt)
{
    sum[rt] = sum[rt<<1] + sum[rt<<1|1];
}
void build(int l ,int r ,int rt)
{
    len[rt] = r - l + 1;
    if(l == r)
    {
        scanf("%I64d",&sum[rt]);
        return ;
    }
    int m = (l + r) >> 1;
    build(lson);
    build(rson);
    PushUp(rt);
}
void update(int L,int R,int l,int r,int rt)
{
    if(l == r)
    {
        sum[rt] = (ll)sqrt(1.0*sum[rt]);
        return ;
    }
    int m = (l + r) >> 1;
    if(L <= m && (sum[rt<<1] != len[rt<<1]))update(L,R,lson);
    if(m < R && (sum[rt<<1|1] != len[rt<<1|1]))update(L,R,rson);
    PushUp(rt);
}
ll query(int L,int R,int l,int r,int rt)
{
    if(L <= l && r <= R)
    {
        return sum[rt];
    }
    int m = (l + r) >> 1;
    ll ret = 0;
    if(L <= m)ret += query(L,R,lson);
    if(m < R)ret += query(L,R,rson);
    return ret;
}
int main()
{
    #ifndef ONLINE_JUDGE
    freopen("in","r",stdin);
    #endif
    int n;
    int cas = 0;
    while(scanf("%d",&n)!=EOF)
    {
        build(1 , n , 1);
        int m,T,a,b;
        printf("Case #%d:\n",++cas);
        scanf("%d",&m);
        while(m--)
        {
            scanf("%d%d%d",&T,&a,&b);
            if(a>b)swap(a,b);
            if(T == 0)update(a,b,1,n,1);
            else printf("%I64d\n",query(a,b,1,n,1));
        }
        puts("");
    }
    return 0;
}