同bzoj3038(戳这里查看),双倍经验。
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 100010
inline ll read(){
ll x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*f;
}
int n,m;
ll a[N];
struct node{
ll sum,mx;
}tree[N<<2];
inline void pushup(int p){
tree[p].sum=tree[p<<1].sum+tree[p<<1|1].sum;
tree[p].mx=max(tree[p<<1].mx,tree[p<<1|1].mx);
}
void build(int p,int l,int r){
if(l==r){
tree[p].sum=tree[p].mx=a[l];return;
}
int mid=l+r>>1;
build(p<<1,l,mid);build(p<<1|1,mid+1,r);
pushup(p);
}
inline void change(int p,int l,int r,int x,int y){
if(tree[p].mx<=1) return;
if(l==r){
tree[p].mx=tree[p].sum=sqrt(tree[p].sum);return;
}
int mid=l+r>>1;
if(x<=mid) change(p<<1,l,mid,x,y);
if(y>mid) change(p<<1|1,mid+1,r,x,y);
pushup(p);
}
inline ll query(int p,int l,int r,int x,int y){
if(x<=l&&r<=y) return tree[p].sum;
int mid=l+r>>1;ll res=0;
if(x<=mid) res+=query(p<<1,l,mid,x,y);
if(y>mid) res+=query(p<<1|1,mid+1,r,x,y);
return res;
}
int main(){
// freopen("a.in","r",stdin);
n=read();for(int i=1;i<=n;++i) a[i]=read();
build(1,1,n);m=read();
while(m--){
int op=read(),x=read(),y=read();if(x>y) swap(x,y);
if(op==1) printf("%lld\n",query(1,1,n,x,y));
else change(1,1,n,x,y);
}
return 0;
}