HDU-4027线段树加减枝

题目链接

如果这个区间都是的数值都是1就不用再更新了，更新了也是浪费时间

#include<cstdio>
#include<cstring>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long int ll;
#define ls 2*i
#define rs 2*i+1
#define mid (T[i].l+T[i].r)/2
#define lson l,(l+r)/2 
#define rson (l+r)/2+1,r
#define check T[i].l >= l && T[i].r <= r
const int mx = 1e5+5;
struct tree{
	int l,r;
	ll x;
	int flag;
}T[4*mx];
void built(int i,int l,int r){
	T[i].l = l,T[i].r = r;
	T[i].flag = 0;
	if(l == r){
		scanf("%lld",&T[i].x);
		return;
	}
	built(ls,lson);
	built(rs,rson);
	T[i].x = T[ls].x + T[rs].x;
}
void update(int i,int l,int r){
	if(T[i].flag)
		return;
	if(T[i].l == T[i].r){
		T[i].x = sqrt(T[i].x);
		if(T[i].x <= 1)
			T[i].flag = 1;
		return ; 
	} 
	if(r <= mid) update(ls,l,r);
	else if(l > mid) update(rs,l,r);
	else{
		update(ls,l,mid);
		update(rs,mid+1,r);
	}
	T[i].x = T[ls].x + T[rs].x;
	T[i].flag = min(T[ls].flag,T[rs].flag);
}
ll find(int i,int l,int r){
	if(check)
		return T[i].x;
	ll sum1 = 0,sum2 = 0;
	if(r <= mid)	sum1 = find(ls,l,r);
	else if(l > mid) sum2 = find(rs,l,r);
	else{
		sum1 = find(ls,l,mid);
		sum2 = find(rs,mid+1,r);
	} 
	return sum1+sum2;
}
int main(){
	int casei = 1;
	int n;
	int q;
	while(scanf("%d",&n)!=EOF){
		built(1,1,n);
		scanf("%d",&q);
		printf("Case #%d:\n",casei++);
		while(q--){
			int l,r,x;
			scanf("%d%d%d",&x,&l,&r);
			if(l > r)
				swap(l,r);
			if(!x) update(1,l,r);
			else printf("%lld\n",find(1,l,r));
		}
		printf("\n");
	}
	return 0;
}