Pagini recente » Cod sursa (job #1568960) | Cod sursa (job #1782041) | Cod sursa (job #75827) | Cod sursa (job #2486706) | Cod sursa (job #422058)
Cod sursa(job #422058)
//#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("aib.in");
ofstream fout("aib.out");
long int n, *c, k;
void add(long int x, long int y)
{
while (x <= n)
{
c[x] += y;
int pos = 0;
while ((x & (1 << pos)) == 0) ++pos;
x += (1 << pos);
++pos;
}
}
long int interog(long int x, long int y)
{
if (x != 1) return interog(1, y) - interog(1, x - 1);
long int sum = 0;
while (y > 0)
{
sum += c[y];
y -= (y & -y);
}
return sum;
}
int main()
{
long int x, y, z, t;
fin >> n >> t;
c = new long int[n + 1];
for (int i = 1; i <= n; ++i)
{
fin >> x;
add(i, x);
};
for (int i = 0; i < t; ++i)
{
fin >> x;
if (x == 0)
{
fin >> y >> z;
add(y, z);
}
if (x == 1)
{
fin >> y >> z;
fout << interog(y, z) << endl;
}
if (x == 2)
{
fin >> y;
for (k = 1; k <= n; ++k)
{
if (interog(1, k) == y) break;
}
if (k == n + 1) k = -1;
fout << k << endl;
}
}
return 0;
}