Pagini recente » Cod sursa (job #1178747) | Cod sursa (job #1867729) | Cod sursa (job #632602) | Cod sursa (job #1715026) | Cod sursa (job #3151153)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin ("datorii.in");
ofstream cout ("datorii.out");
vector<int> bit(100005, 0);
int v[100005];
int n;
void update(int i, int val)
{
while(i<=n)
{
bit[i]+=val;
i+=i&(-i);
}
}
int prefix(int i)
{
int sum=0;
while(i>0)
{
sum+=bit[i];
i-=i&(-i);
}
return sum;
}
int rangesum(int i, int j)
{
return prefix(j)-prefix(i-1);
}
int cb(int x, int st, int dr)
{
int mid,s;
while(st<dr)
{
mid=(st+dr)/2;
s=prefix(mid);
if(s>=x)
dr=mid;
else
st=mid+1;
}
return st;
}
int main()
{
int m,val,i,a,b;
cin>>n>>m;
for(i=1; i<=n; i++)
{
cin>>v[i];
update(i,-v[i]);
}
for(i=1; i<=m; i++)
{
cin>>val;
if(val==0)
{
cin>>a>>b;
update(a,b);
}
else if(val==1)
{
cin>>a>>b;
cout<<-rangesum(a,b)<< '\n';
}
}
return 0;
}