Pagini recente » Cod sursa (job #1297860) | Cod sursa (job #2040549) | Cod sursa (job #1274928) | Cod sursa (job #2929713) | Cod sursa (job #2307966)
#include <bits/stdc++.h>
using namespace std;
int i, n, value, p, val, a, b, st, dr, mij, poz, m;
long long aib[100005];
int LastBit(int x)
{
return x & (- x);
}
void update(int index, int value)
{
for(int i = index; i <= n; i = i + LastBit(i))
aib[i] = aib[i] + value;
}
int query(int value)
{
int s = 0;
for(int i = value; i > 0; i = i - LastBit(i))
s = s + aib[i];
return s;
}
int main()
{
ifstream f("aib.in");
ofstream g("aib.out");
f >> n >> m;
for(i = 1; i <= n; i ++)
{
f >> value;
update(i, value);
}
for(i = 1; i <= m; i ++)
{
f >> p;
if(p == 0)
{
f >> a >> b;
update(a, b);
}
if(p == 1)
{
f >> a >> b;
g << query(b) - query(a - 1) << "\n";
}
if(p == 2)
{
f >> value;
poz = 0;
st = 1;
dr = n;
while(st <= dr)
{
mij = (st + dr) / 2;
val = query(mij);
if(val == value)st = dr + 1, poz = mij;
else if(val < value)st = mij + 1;
else dr = mij - 1;
}
if(poz == 0)g << "-1" << "\n";
else g << poz << "\n";
}
}
return 0;
}