题意:给你n个数,输入T,X,Y。能够进行两种操作;
1、如果T为0,让[X,Y]区间内的数都变为自身的平方根
2、如果T为1,求[X,Y]区间内的和。
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
const int MAX_N=500005;
int N;
ll Tree[MAX_N<<2];
void Bulid(int l, int r, int rt)
{
if(l == r)
{
scanf("%lld",&Tree[rt]);
return ;
}
int mid = (l + r)>>1;
Bulid(l, mid, rt<<1);
Bulid(mid+1, r, rt<<1|1);
Tree[rt] = Tree[rt<<1] + Tree[rt<<1|1];
}
void Quedate(int l1, int r1, int l, int r, int rt)
{
if(l == r)
{
Tree[rt] = sqrt(Tree[rt]);
// cout<<"@@@"<<rt<<"#######"<<Tree[rt]<<endl;
return ;
}
if(l1 <= l&&r1 >= r && Tree[rt] == r - l + 1) return;
int mid = (l + r)>>1;
if(l1 <= mid ) Quedate(l1, r1, l, mid, rt<<1);
if(r1 > mid) Quedate(l1, r1, mid+1, r, rt<<1|1);
Tree[rt] = Tree[rt<<1] + Tree[rt<<1|1];
}
ll Query(int L, int R, int l, int r, int rt)
{
if(L<=l&&r<=R)
{
return Tree[rt];
}
ll ans=0;
int mid = (l + r)>>1;
if(L<=mid) ans+=Query(L,R,l,mid,rt<<1);
if(R>mid) ans+=Query(L,R,mid+1,r,rt<<1|1);
return ans;
}
int main()
{
//ios::sync_with_stdio(false);
int k=1;
while(cin>>N){
Bulid(1,N,1);
int m,t,a,b;
cin>>m;
cout<<"Case #"<<k++<<":"<<endl;
while(m--){
scanf("%d%d%d",&t,&a,&b);
int aa = min(a,b);
int bb = max(a,b);
// cout<<aa<<" "<<bb<<endl;
if(t == 0){
Quedate(aa,bb,1,N,1);
}else{
printf("%lld\n",Query(aa,bb,1,N,1));
}
}
printf("\n");
}
}