ZOJ3279Ants(树状数组前缀和)

本文介绍了一种通过二分搜索和前缀和方法解决蚂蚁等级查询与更新的问题,包括输入输出示例及完整代码实现。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

echo is a curious and clever girl, and she is addicted to the ants recently.

She knows that the ants are divided into many levels depends on ability, also, she finds the number of each level will change.

Now, she will give two kinds of operations as follow :

First, "p a b", the number of ants in level a change to b.

Second, "q x", it means if the ant's ability is rank xth in all ants, what level will it in?

Input

There are multi-cases, and you should use EOF to check whether it is in the end of the input. The first line is an integer n, means the number of level. (1 <= n <= 100000). The second line follows n integers, the ith integer means the number in level i. The third line is an integer k, means the total number of operations. Then following k lines, each line will be"p a b" or "q x", and 1 <= x <= total ants, 1 <= a <= n, 0 <= b. What's more, the total number of ants won't exceed 2000000000 in any time.

Output

Output each query in order, one query each line.

Sample Input

3
1 2 3
3
q 2
p 1 2
q 2

Sample Output

2
1

这道题让我想起了今天网络赛的一题。。。模型几乎是一样的,只是当时怎么接触过前缀和。。。加上二分搜索答案。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
using namespace std;
const int maxn = 100000+10;
int A[maxn],C[maxn];
int n;
int lowbit(int x){
    return x&-x;
}
void add(int x,int d){
    while(x <= n){
        C[x] += d;
        x += lowbit(x);
    }
}
int sum(int x){
    int ret = 0;
    while(x > 0){
        ret += C[x];
        x -= lowbit(x);
    }
    return ret;
}
int binary_search(int x){
    int l = 1, r = n;
    int ans=1;
    while(l <= r){
        int mid = (l+r)/2;
        int t = sum(mid);
        if(t >= x){
            r = mid-1;
            ans = mid;
        }else{
            l = mid+1;
        }
    }
    return ans;
}
void solve(){
    int m;
    scanf("%d",&m);
    while(m--){
        char op;
        cin >> op;
        if(op=='q'){
            int k;
            scanf("%d",&k);
            cout<<binary_search(k)<<endl;
        }else{
            int a,b;
            scanf("%d%d",&a,&b);
            add(a,b-A[a]);
            A[a] = b;
        }
    }
}
void input(){
    memset(C,0,sizeof(C));
    for(int i = 1; i <= n; i++){
        scanf("%d",&A[i]);
        add(i,A[i]);
    }
}
int main(){
    while(~scanf("%d",&n)){
        input();
        solve();
    }
    return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值