hdu4027 Can you answer these queries?（线段树）

hdu4027

#include <bits/stdc++.h>
using namespace std;
typedef long long llt;
struct Tree
{
	int l,r;
	llt sum; 
}b[100000*4+1024];
void build(int l,int r,int i)
{
	b[i].l=l;
	b[i].r=r;
	if(l==r){
		scanf("%lld",&b[i].sum);
		return;
	}
	int m=(l+r)/2;
	build(l,m,2*i);
	build(m+1,r,2*i+1);
	b[i].sum=b[2*i].sum+b[2*i+1].sum;
}
void help(int k,int i)//单点更新
{
	if(b[i].l==b[i].r){
		b[i].sum=(llt)sqrt(1.0*b[i].sum);
		return;
	}
	int m=(b[i].l+b[i].r)/2;
	if(k<=m) help(k,2*i);
	else help(k,2*i+1);
	b[i].sum=b[2*i].sum+b[2*i+1].sum;
}
void update(int l,int r,int i)
{
	if(b[i].l==l&&b[i].r==r){
		if(b[i].sum==r-l+1) return;
		while(l<=r) help(l++,1);
		return;
	}
	int m=(b[i].l+b[i].r)/2;
	if(r<=m)update(l,r,2*i);
	else if(l>m) update(l,r,2*i+1);
	else {
		update(l,m,2*i);
		update(m+1,r,2*i+1);
	}
}
llt query(int l,int r,int i)
{
	if(b[i].l==l&&b[i].r==r) return b[i].sum;
	int m=(b[i].l+b[i].r)/2;
	if(r<=m) return query(l,r,2*i);
	else if(l>m) return query(l,r,2*i+1);
	return query(l,m,2*i)+query(m+1,r,2*i+1);
}
int main()
{
	// freopen("1.txt","r",stdin);
	int n,m,cs=0;
	while(~scanf("%d",&n)){
		printf("Case #%d:\n",++cs);
		build(1,n,1);
		scanf("%d",&m);
		while(m--){
			int op,l,r;
			scanf("%d %d %d",&op,&l,&r);
			if(l>r) swap(l,r);
			if(op==0) update(l,r,1);
			else printf("%lld\n",query(l,r,1));
		}
		printf("\n");
	}
	return 0;
}