Pagini recente » Cod sursa (job #634631) | Cod sursa (job #1382124) | Cod sursa (job #951156) | Cod sursa (job #2229077) | Cod sursa (job #1505330)
#include<algorithm>
#include<stdio.h>
#define Nmax 101010
using namespace std;
int num
int M,x,y,z;
int AIB[Nmax], N;
inline int zeros(int x) { return x & (-x); }
inline void Add(int x, int q) {
for (int i = x; i <= N; i += zeros(i)) AIB[i]+=q;
}
inline int comp(int x) {
ret = 0;
for (int i = x; i > 0; i -= zeros(i)) ret += AIB[i];
return ret;
}
int main()
{
freopen("aib.in","r",stdin);
freopen("aib.out","w",stdout);
scanf("%d%d",&N,&M);
int x;
for(int i=1;i<=N;++i)
{
scanf("%d",&x);
Add(i,x);
}
for(int i=1;i<=M;++i)
{
scanf("%d%d",&x,&y);
if(x==0)
{ scanf("%d",&z);
Add(y,z);
}
if(x==1)
{ scanf("%d",&z);
printf("%d\n",comp(z)-comp(y-1));
}
if(x==2)
{
int st=1,dr=N,mij,rez=-1;
while(st<=dr)
{
mij=(st+dr)/2;
//printf("%d !",mij);
if(comp(mij)>y)
{
dr=mij-1;
//rez=mij;
}
else if(comp(mij)==y)
{
dr=mij-1;
rez=mij;
}
else st=mij+1;
}
printf("%d\n",rez);
}
}
}