Pagini recente » Cod sursa (job #2643347) | Cod sursa (job #1834126) | Cod sursa (job #2916699) | Cod sursa (job #841873) | Cod sursa (job #1506954)
#include <iostream>
#include <fstream>
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+=zeros(i))
if (sum(i)==a) return i;
return -1;
}
int main()
{
fin>>n>>m; int x;
for (int i=1; i<=n; ++i)
{
fin>>x;
update(i,x);
}
for (int i=1; i<=m; ++i)
{
int caz; fin>>caz;
int a,b;
switch(caz)
{
case 0:
fin>>a>>b;
update(a,b);
break;
case 1:
fin>>a>>b;
fout<<sum(b)-sum(a-1)<<'\n';
break;
case 2:
fin>>a;
fout<<pozK(a)<<'\n';
break;
}
}
return 0;
}