Pagini recente » Cod sursa (job #2108313) | Cod sursa (job #749963) | Cod sursa (job #143438) | Cod sursa (job #639249) | Cod sursa (job #2058120)
#include <fstream>
using namespace std;
ifstream fin("aib.in");
ofstream fout("aib.out");
const int NMAX = 100000 + 5;
int n, m;
int aib[NMAX];
int zeros(int x)
{
return x ^ (x & (x - 1));
}
void update(int poz, int val)
{
for (int i = poz; i <= n; i += zeros(i))
aib[i] += val;
}
int query(int poz)
{
int rez = 0;
for (int i = poz; i; i -= zeros(i))
rez += aib[i];
return rez;
}
int sum(int st, int dr)
{
return query(dr) - query(st - 1);
}
int bs(int total)
{
int st = 1, dr = n, mijl, ans;
while (st <= dr)
{
mijl = (st + dr) / 2;
if (query(mijl) <= total)
{
st = mijl + 1;
ans = mijl;
}
else
dr = mijl - 1;
}
return ans;
}
void read()
{
int x;
fin >> n >> m;
for (int i = 1; i <= n; ++i)
{
fin >> x;
update(i, x);
}
}
int main()
{
int cod, a, b;
read();
while (m--)
{
fin >> cod >> a;
if (cod != 2)
fin >> b;
if (cod == 0)
update(a, b);
else if (cod == 1)
fout << sum(a, b) << '\n';
else
fout << bs(a) << '\n';
}
return 0;
}