树状数组板子全wa,求调
查看原帖
树状数组板子全wa,求调
308675
franklinwqf楼主2022/8/8 19:18
#include<bits/stdc++.h>
using namespace std;
long long n,m,a[500005],c[500005],i,j;
char judge;
int lowbit(int x){
	return x&-x;
}
void add(int x,int delta){
	for(int i = x;i<=n;i+=lowbit(i)){
		c[i] += delta;
	}
}
int getsum(int x){
	int ans = 0;
	for(int i = x;i;i-=lowbit(i)){
		ans+=c[i];
	}
	return ans;
}
int main(){
	cin>>n>>m;
	int x,k;
	int y,z;
	for(int i = 1;i<=n;i++){
		a[i] = 0;
	}
	for(int i = 1;i<=m;i++){
		cin>>judge;
		if(judge=='x'){
			cin>>x>>k;
			add(x,k);
		}
		else{
			cin>>y>>z;
			cout<<getsum(z)-getsum(y-1)<<endl;
		}
	}
	return 0;
}

2022/8/8 19:18
加载中...