Pagini recente » Cod sursa (job #419476) | Cod sursa (job #43559) | Cod sursa (job #2788855) | Cod sursa (job #2934388) | Cod sursa (job #2710609)
#include <iostream>
#include <fstream>
#define u(x) ((x ^ (x - 1)) & x)
using namespace std;
ifstream fin("aib.in");
ofstream fout("aib.out");
int aib[100005], v[100005];
int n, k, op;
void Update(int poz, int x)
{
for (int i = poz; i <= n; i += u(i))
aib[i] += x;
}
int Query(int poz)
{
int sum = 0;
for (int i = poz; i > 0; i = i - u(i))
sum += aib[i];
return sum;
}
int CautareBinara(int a[], int n, int nr)
{
int st = 1, dr = n;
while (st <= dr)
{
int mij = (st + dr) / 2;
int x = Query(mij);
if (x == nr)
return mij;
else
{
if (x > nr)
dr = mij - 1;
else if (x < nr)
st = mij + 1;
}
}
return -1;
}
int main()
{
int i;
int poz, x, y, nr;
fin >> n >> k;
for (i = 1; i <= n; ++i)
{
fin >> v[i];
Update(i, v[i]);
}
for (i = 1; i <= k; ++i)
{
fin >> op;
if (op == 0)
{
fin >> poz >> x;
Update(poz, x);
}
else if (op == 1)
{
fin >> x >> y;
fout << Query(y) - Query(x - 1) << "\n";
}
else if (op == 2)
{
fin >> nr;
fout << CautareBinara(aib, n, nr) << "\n";
}
}
return 0;
}