Cod sursa(job #2414078)
| Utilizator | Data | 24 aprilie 2019 08:03:37 | |
|---|---|---|---|
| Problema | Arbori indexati binar | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("aib.in");
ofstream g("aib.out");
int n,m,c,x,y,a[100001];
void aduna(int p,int y)
{
for(;p<=n;p+=p&(-p))
a[p]+=y;
}
int suma(int p)
{
int s=0;
for(;p;p-=p&(-p))
s+=a[p];
return s;
}
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++)
f>>a[i];
for(int i=1;i<=m;i++)
{
f>>c>>x>>y;
if(c==0)
{
aduna(x,y);
}
else if(c==1)
{
g<<suma(y)-suma(x-1)<<'\n';
}
}
return 0;
}
