Cod sursa(job #2952871)
Utilizator | Vidru Rares gifi | Data | 10 decembrie 2022 09:48:22 |
---|---|---|---|
Problema | Datorii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include<fstream>
using namespace std;
ifstream cin("datorii.in");
ofstream cout("datorii.out");
int n,m,B[15005],x,y,c;
void mod(int i1,int i2)
{for (int i=i1;i<=n;i+=i&(-i)) B[i]+=i2;
}
int sum(int i1)
{int s=0;
for (int i=i1;i>=1;i-=i&(-i)) s+=B[i];
return s;
}
int main()
{cin>>n>>m;
for (int i=1;i<=n;i++) cin>>x,mod(i,x);
for (int i=1;i<=m;i++)
{cin>>c>>x>>y;
if (!c) mod(x,-y);
else cout<<sum(y)-sum(x-1)<<'\n';
}
return 0;
}