Pagini recente » Cod sursa (job #1743033) | Cod sursa (job #1774442) | Cod sursa (job #1218900) | Cod sursa (job #2720829) | Cod sursa (job #422063)
Cod sursa(job #422063)
//#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("aib.in");
ofstream fout("aib.out");
long int n, *c, k, st;
void add(long int x, long int y)
{
while (x <= n)
{
c[x] += y;
x += (x & -x);
}
}
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)
{
st = interog(1, k);
if (st > y)
{
k = n + 1;
break;
}
if (st == y) break;
}
if (k == n + 1) k = -1;
fout << k << endl;
}
}
return 0;
}