Cod sursa(job #2349916)
| Utilizator | Data | 20 februarie 2019 20:36:46 | |
|---|---|---|---|
| Problema | Arbori indexati binar | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.99 kb |
#include <fstream>
using namespace std;
ifstream f("aib.in");
ofstream g("aib.out");
int BITree[100005],n,x,m,a,b;
int getSum(int q)
{
int s=0;
while(q)
{
s=s+BITree[q];
q-=q &(-q);
}
return s;
}
void update(int q, int val)
{
while(q<= n)
{
BITree[q]+=val;
q+=q &(-q);
}
}
int main()
{
f>>n>>m;
for(int i=1; i<=n; i++)
{
f>>x;
update(i, x);
}
for(int i=1; i<=m; i++)
{
f>>x;
if(x==0)
{
f>>a>>b;
update(a, b);
}
if(x==1)
{
f>>a>>b;
g<<getSum(b)-getSum(a-1)<<'\n';
}
if(x==2)
{
f>>a;
for(int j=1; j<=n; j++)
{
if(getSum(j)==a)
{
g<<j<<'\n';
break;
}
}
}
}
return 0;
}
