Pagini recente » Cod sursa (job #1911984) | Cod sursa (job #2332692) | Cod sursa (job #2472854) | Cod sursa (job #2783188) | Cod sursa (job #2009942)
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define in insert
#define er erase
#define fr first
#define sc second
const int inf=INT_MAX;
const int nmax=2e4+5;
const int mod=1e9+7;
typedef long long ll;
using namespace std;
int n,m,i,bit[nmax],v,x,y;
void upd(int i,int vl)
{
for(;i<=n;i+=(i&(-i)))bit[i]+=vl;
}
int query(int i)
{
int sum=0;
for(;i>=1;i-=(i&(-i)))sum+=bit[i];
return sum;
}
int main()
{
//ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
FILE *fr,*fw;
fr=fopen("datorii.in","r");
fw=fopen("datorii.out","w");
fscanf(fr,"%d %d",n,m);
for(i=1;i<=n;i++)fscanf(fr,"%d",x),upd(i,x);
fclose(fr);
while(m--)
{
cin>>v>>x>>y;
if(!v)upd(x,-y);
else fprintf(fw,"%d /n",query(y)-query(x-1));
}
fclose(fw);
return 0;
}