Pagini recente » Cod sursa (job #1255930) | Cod sursa (job #37897) | Cod sursa (job #1878982) | Cod sursa (job #1326502) | Cod sursa (job #1506965)
#include <iostream>
#include <fstream>
#include <cstdio>
using namespace std;
/*ifstream fin("aib.in");
ofstream fout("aib.out");*/
int n,m,aib[100001];
inline int zeros(int x)
{
return (-x)&x;
}
void update(int poz, int val)
{
for (int i=poz; i<=n; i+=zeros(i))
aib[i]+=val;
}
int sum(int poz)
{
long long s=0;
for (; poz; poz-=zeros(poz))
s+=aib[poz];
return s;
}
int pozK(int a)
{
for (int i=1; i<=n; i++)
if (sum(i)==a) return i;
return -1;
}
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);
update(i,x);
}
for (int i=1; i<=m; ++i)
{
int caz; scanf("%d",&caz);
int a,b;
switch(caz)
{
case 0:
scanf("%d%d",&a,&b);
update(a,b);
break;
case 1:
scanf("%d%d",&a,&b);
printf("%d\n",sum(b)-sum(a-1));
break;
case 2:
scanf("%d",&a);
printf("%d\n",pozK(a));
break;
}
}
return 0;
}