HDU4027 Can you answer these queries? 线段树

思路：http://www.cnblogs.com/gufeiyang/p/4182565.html

写写线段树

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
using namespace std;
typedef long long LL;
const int N=1e5+;
LL a[N<<];
void build(int rt,int l,int r){
    if(l==r){
       scanf("%I64d",&a[rt]);
       return;
    }
    int m=(l+r)>>;
    build(rt<<,l,m);
    build(rt<<|,m+,r);
    a[rt]=a[rt<<]+a[rt<<|];
}
void modify(int rt,int l,int r,int x,int y){
    if(x<=l&&r<=y){
      if(a[rt]==r-l+)return;
    }
    if(l==r){
       a[rt]=sqrt(1.0*a[rt]);
       return;
    }
    int m=(l+r)>>;
    if(x<=m)modify(rt<<,l,m,x,y);
    if(y>m)modify(rt<<|,m+,r,x,y);
    a[rt]=a[rt<<]+a[rt<<|];
}
LL ask(int rt,int l,int r,int x,int y){
    if(x<=l&&r<=y)return a[rt];
    LL ans=;
    int m=(l+r)>>;
    if(x<=m)ans+=ask(rt<<,l,m,x,y);
    if(y>m)ans+=ask(rt<<|,m+,r,x,y);
    return ans;
}
int main(){
    int n,cas=;
    while(~scanf("%d",&n)){
        printf("Case #%d:\n",++cas);
        build(,,n);
        int q;
        scanf("%d",&q);
        while(q--){
           int op,x,y;
           scanf("%d%d%d",&op,&x,&y);
           if(x>y)swap(x,y);
           if(op)printf("%I64d\n",ask(,,n,x,y));
           else modify(,,n,x,y);
        }
        printf("\n");
    }
    return ;
}