Cod sursa(job #2393162)

Utilizator dinugaftonGafton Dinu dinugafton Data 30 martie 2019 22:45:07
Problema Arbori indexati binar Scor 30
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.02 kb
#include<bits/stdc++.h>
using namespace std;
#define ion 100005
int n,m,a[ion],bit[ion],k,x,y,c;
int suma(int index){
	int sum=0;
	while(index>0){
		sum+=bit[index];
		index-=index&(-index);
	}
	return sum;
}
void update(int index, int val){
	while(index<=n){
		bit[index]+=val;
		index+=index&(-index);
	}
}
void creare(){
	for(int i=1;i<=n;i++)
	    update(i,a[i]);
}
int main(){
	freopen("aib.in","r",stdin);
	ofstream cout("aib.out");
	scanf("%d",&n);scanf("%d",&m);
	for(int i=1;i<=n;i++)
	    scanf("%d",&a[i]);
	creare();
	for(int i=1;i<=m;i++){
		scanf("%d",&c);
		if(c==1||c==0){
			scanf("%d",&x);
			scanf("%d",&y);
		}else scanf("%d",&k);
		switch(c){
			case 0:{
				update(x,y);
				break;
			}
			case 1:{
				cout<<suma(y)-suma(x-1)<<'\n';
				break;
			}
			case 2:{
				for(int i=1;i<=n+1;i++){
					if(i==n+1){
						cout<<-1<<'\n';
						break;
					}
				    if(suma(i)==k){
				    	cout<<i<<'\n';
				    	break;
					}
				}
				break;
			}
		}
	}
	return 0;
}