Pagini recente » Cod sursa (job #2924079) | Cod sursa (job #2353705) | Cod sursa (job #844867) | Cod sursa (job #270868) | Cod sursa (job #2236799)
#include<cstdio>
#include<fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
long long AIB[15002],n;
long long querySum(long long poz) {
long long answer = 0;
for (long long i = poz; i > 0; i -= i & -i)
answer += AIB[i];
return answer;
}
void update(long long poz, long long add) {
for (long long i = poz; i <= n; i += i & -i)
AIB[i] += add;
}
int main()
{
long long m,x,p,i,y;
f>>n>>m;
for(i=1;i<=n;i++)
{
f>>x;
update(i,x);
}
for(i=1;i<=m;i++)
{
f>>p>>x>>y;
if(p==0)
{
update(x,-y);
}
else
{
g<<querySum(y)-querySum(x-1)<<'\n';
}
}
return 0;
}