Pagini recente » Cod sursa (job #521098) | Borderou de evaluare (job #1567235) | Cod sursa (job #2815143) | Cod sursa (job #3177324) | Cod sursa (job #2884003)
#include <bits/stdc++.h>
#define lsb(x) ((x^(x-1))+1)/2
#define NMAX 100004
using namespace std;
ifstream fin ("aib.in");
ofstream fout ("aib.out");
int n, m;
int aib[NMAX];
void update(int poz, int val);
int sum(int poz);
int caut_binar(int x);
int caut_binar2(int x);
int main()
{
int x, tip, a, b;
fin >> n >> m;
for (int i = 1; i <= n; i++)
{
fin >> x;
update(i, x);
}
for (int i = 1; i <= m; i++)
{
fin >> tip;
if (tip == 0)
{
fin >> a >> b;
update(a, b);
}
else if (tip == 1)
{
fin >> a >> b;
fout << sum(b) - sum(a-1) << '\n';
}
else
{
fin >> a;
b = caut_binar2(a);
if (sum(b) != a || b == 0 || b == n+1)
b = -1;
fout << b << '\n';
}
}
return 0;
}
void update(int poz, int val)
{
for (int i = poz; i <= n; i += lsb(i))
aib[i] += val;
}
int sum(int poz)
{
int s = 0;
for (int i = poz; i; i -= lsb(i))
s += aib[i];
return s;
}
int caut_binar(int x)
{
int st = 0, dr = n + 1, mij;
while (dr - st > 1)
{
mij = (st + dr) / 2;
if (sum(mij) < x)
st = mij;
else if (sum(mij) > x)
dr = mij;
else
return mij;
}
return -1;
}
int caut_binar2(int x)
{
int st = 0, dr = n + 1, mij;
while (dr - st > 1)
{
mij = (st + dr) / 2;
if (sum(mij) <= x)
st = mij;
else
dr = mij;
}
return st;
}