Cod sursa(job #2298137)
| Utilizator | Data | 7 decembrie 2018 16:10:06 | |
|---|---|---|---|
| Problema | Datorii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("datorii.in");
ofstream out("datorii.out");
int n,m,aib[15005];
void update(int p,int x)
{
for (;p<=n;p+=(p&(-p)))
aib[p]+=x;
}
int query(int p)
{
int s=0;
for (;p>0;p-=(p&(-p)))
s+=aib[p];
return s;
}
int main()
{int i,x,y,tip;
in>>n>>m;
for (i=1;i<=n;i++)
{
in>>x;
update(i,x);
}
for (i=1;i<=m;i++)
{
in>>tip>>x>>y;
if (tip==0)update(x,-y);
else out<<query(y)-query(x-1)<<"\n";
}
out.close();
in.close();
return 0;
}
