Cod sursa(job #2292194)
Utilizator | Data | 29 noiembrie 2018 09:12:47 | |
---|---|---|---|
Problema | Datorii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int n,aib[15001],m,cif,a,b,x;
void adun(int x,int val)
{
int i;
for(i=x; i<=n; i+=i&(-i))
aib[i]+=val;
}
int suma(int x)
{
int s=0,i;
for(i=x; i>=1; i-=i&(-i))
s+=aib[i];
return s;
}
int main()
{
int i;
fin>>n>>m;
for(i=1; i<=n; i++)
fin>>x,adun(i,x);
for(i=1; i<=m; i++)
{
fin>>cif>>a>>b;
if(cif==0) adun(a,-b);
else fout<<suma(b)-suma(a-1)<<'\n';
}
return 0;
}