1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
|
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#define rep(i,x,y) for(register int i=x;i<=y;++i)
#define repd(i,x,y) for(register int i=x;i>=y;--i)
#define lson o<<1,l,mid
#define rson o<<1|1,mid+1,r
#define LL long long
using namespace std;
const int N=1e6;
LL rt[N<<2];
int n,m,cnt;
inline void (int o){rt[o]=rt[o<<1]+rt[o<<1|1];}
inline void build(int o,int l,int r){
if(l==r){scanf("%lld",&rt[o]);return ;}
int mid=l+r>>1;
build(lson);
build(rson);
pushup(o);
}
inline void update(int o,int l,int r,int ll,int rr){
if(l==r){rt[o]=sqrt(rt[o]);return ;}
if(rt[o]==r-l+1)return ;
int mid=l+r>>1;
if(ll<=mid)update(lson,ll,rr);
if(rr>mid)update(rson,ll,rr);
pushup(o);
}
inline LL query(int o,int l,int r,int ll,int rr){
if(ll<=l&&rr>=r)return rt[o];
int mid=l+r>>1;
LL ans=0;
if(ll<=mid)ans+=query(lson,ll,rr);
if(rr>mid)ans+=query(rson,ll,rr);
return ans;
}
int main(){
while(~scanf("%d",&n)){
printf("Case #%d:n",++cnt);
build(1,1,n);
scanf("%d",&m);
while(m--){
int op,x,y;
scanf("%d%d%d",&op,&x,&y);
if(x>y)swap(x,y);
if(op)printf("%lldn",query(1,1,n,x,y));
else update(1,1,n,x,y);
}
printf("n");
}
return 0;
}
|
近期评论