only AC #1 and sub 求调

#include<bits/stdc++.h>
using namespace std;
#define int long long

const int N=1e5+5,Mod=998244353;
int a[N],mx[N*4],sum[N*4];
void pushup(int idx)
{
	mx[idx]=max(mx[idx<<1],mx[idx<<1|1]);
	sum[idx]=sum[idx<<1]+sum[idx<<1|1]; 
}
void build_tree(int idx,int l,int r)
{
	if(l==r)
	{
		sum[idx]=a[l];
		mx[idx]=a[l];
	}
	else
	{
		int m=l+r>>1,lch=idx<<1,rch=idx<<1|1;
		build_tree(lch,l,m),build_tree(rch,m+1,r);
		pushup(idx);
	}
}
void modify(int idx,int l,int r,int left,int right)
{
	if(l==r&&l>=left&&r<=right)
	{
		sum[idx]=sqrt(sum[idx]);
		mx[idx]=sqrt(sum[idx]);
	}
	else
	{
		int m=l+r>>1,lch=idx<<1,rch=idx<<1|1;
		if(left<=m&&mx[lch]>1)
		{
			modify(lch,l,m,left,right);
		}
		if(m<right&&mx[rch]>1)
		{
			modify(rch,m+1,r,left,right);
		}
		pushup(idx);
	}
}
int query(int idx,int l,int r,int left,int right)
{
	if(left<=l&&r<=right)
	{
		return sum[idx];
	}
	int m=l+r>>1,lch=idx<<1,rch=idx<<1|1;
	int ans=0;
	if(left<=m)
	{
		ans+=query(lch,l,m,left,right);
	}
	if(m<right)
	{
		ans+=query(rch,m+1,r,left,right);
	}
	return ans;
}

signed main()
{
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n,m;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
	}
	build_tree(1,1,n);
	cin>>m;
	for(int i=1,op,l,r;i<=m;i++)
	{
		cin>>op>>l>>r;
		if(l>r)
		{
			swap(l,r);
		}
		if(op==0)
		{
			modify(1,1,n,l,r);
		}
		else
		{
			cout<<query(1,1,n,l,r)<<endl;
		}
	}
	return 0;
}