Pagini recente » Cod sursa (job #2352393) | Cod sursa (job #523196) | Cod sursa (job #2649872) | Cod sursa (job #2659016) | Cod sursa (job #3293680)
#include <bits/stdc++.h>
using namespace std;
///aemi
ifstream fin("aib.in");
ofstream fout("aib.out");
int n, Q;
int aib[100005];
void Update(int p, int val)
{
while (p <= n)
{
aib[p] += val;
p += (p & (-p));
}
}
int Query(int p)
{
int suma = 0;
while (p >= 1)
{
suma += aib[p];
p -= (p & (-p));
}
return suma;
}
int CautBin(int val)
{
int st, dr, mij, suma, P;
st = 1; dr = n; P = -1;
while (st <= dr)
{
mij = (st + dr) / 2;
suma = Query(mij);
if (suma == val) P = mij;
if (suma >= val) dr = mij - 1;
else st = mij + 1;
}
return P;
}
int main()
{
int op, x, y;
fin >> n >> Q;
for (int i = 1; i <= n; i++)
{
fin >> x;
Update(i, x);
}
while (Q--)
{
fin >> op;
if (op == 0)
{
fin >> x >> y;
Update(x, y);
}
else if (op == 1)
{
fin >> x >> y;
fout << Query(y) - Query(x - 1) << "\n";
}
else
{
fin >> x;
fout << CautBin(x) << "\n";
}
}
return 0;
}