Pagini recente » Cod sursa (job #2677463) | Cod sursa (job #2489768) | Cod sursa (job #2901573) | Cod sursa (job #2269136) | Cod sursa (job #1547388)
#include<stdio.h>
using namespace std;
const int N = 100005;
int suma[N], n;
void actualizare (int i, int val)
{
while (i <= n)
{
suma[i] += val;
i += (i&-i);
}
}
int interog (int i)
{
int s = 0;
while (i != 0)
{
s += suma[i];
i -= (i&-i);
}
return s;
}
int cautBin (int a)
{
int pas = 1 << 16;
int i = 0;
while (pas != 0)
{
if (i + pas <= n && suma[i + pas] <= a)
{
a -= suma[i + pas];
i += pas;
}
pas /= 2;
}
if (a == 0)
return i;
return -1;
}
int main ()
{
FILE *in, *out;
in = fopen ("aib.in", "r");
out = fopen ("aib.out", "w");
int m;
fscanf (in, "%d%d", &n, &m);
int i, x;
for (i = 1; i <= n; i++)
{
fscanf (in, "%d", &x);
actualizare (i, x);
}
int a, b;
for (i = 1; i <= m; i++)
{
fscanf (in, "%d", &x);
if (x == 0)
{
fscanf (in, "%d%d", &a, &b);
actualizare (a, b);
}
if (x == 1)
{
fscanf (in, "%d%d", &a, &b);
fprintf (out, "%d\n", interog(b) - interog(a - 1));
}
if (x == 2)
{
fscanf (in, "%d", &a);
fprintf (out, "%d\n", cautBin(a));
}
}
return 0;
}