HDU 4027

最新推荐文章于 2019-11-06 09:56:53 发布

KinderRiven

最新推荐文章于 2019-11-06 09:56:53 发布

阅读量487

点赞数

CC 4.0 BY-SA版权

分类专栏：数据结构

本文链接：https://blog.youkuaiyun.com/u013451221/article/details/45394309

数据结构专栏收录该内容

79 篇文章

订阅专栏

/*
Can you answer these queries?
*/
#include<cstdio>
#include<cmath>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long LL;
#define lson (pos<<1)
#define rson (pos<<1|1)
const int maxn = 100005;
LL   sum[maxn << 2];
bool vis[maxn << 2];
void pushup(int pos){
    sum[pos] = sum[lson] + sum[rson];
    if(vis[lson] && vis[rson]) vis[pos] = true;
}
void build(int l,int r,int pos){
    vis[pos] = false;
    if(l == r){
        scanf("%I64d",&sum[pos]);
        if(sum[pos] <= 1)
            vis[pos] = true;
        return;
    }
    int mid = (l + r) >> 1;
    build(l,mid,lson);
    build(mid + 1,r,rson);
    pushup(pos);
}
void update(int L,int R,int l,int r,int pos){
    if(L == R){
        sum[pos] = sqrt(sum[pos]);
        if(sum[pos] <= 1)
            vis[pos] = true;
        return;
    }
    int mid = (L + R) >> 1;
    if(l <= mid && !vis[lson])
        update(L,mid,l,r,lson);
    if(r  > mid && !vis[rson])
        update(mid + 1,R,l,r,rson);
    pushup(pos);
}
LL query(int L,int R,int l,int r,int pos){
    if(l <= L && R <= r)
        return sum[pos];
    LL ans = 0;
    int mid = (L + R) >> 1;
    if(l <= mid)
        ans += query(L,mid,l,r,lson);
    if(r  > mid)
        ans += query(mid + 1,R,l,r,rson);
    return ans;
}
int main(){
    int n,m,Case = 1;
    while(scanf("%d",&n) != EOF){
        build(1,n,1);
        scanf("%d",&m);
        LL ans;
        printf("Case #%d:\n",Case++);
        for(int i = 0;i < m; i++){
            int op,x,y;
            scanf("%d%d%d",&op,&x,&y);
            if(x > y) swap(x,y);
            if(op == 0)
                update(1,n,x,y,1);
            else
                printf("%I64d\n",query(1,n,x,y,1));
        }
        puts("");
    }
    return 0;
}