Pagini recente » Borderou de evaluare (job #2919764) | Cod sursa (job #942574) | Istoria paginii utilizator/cs_2024_64 | Cod sursa (job #909389)
Cod sursa(job #909389)
#include <cstdio>
#include <algorithm>
#define NMAX 100001
#define zeros(x) ((x ^ (x - 1)) & x)
using namespace std;
int n;
int aib[NMAX];
void add(int poz, int val)
{
aib[poz] += val;
int k = zeros(poz);
if(poz + k <= n)
add(poz + k, val);
}
void readArray()
{
int x;
for(int i = 1; i <= n; ++ i)
{
scanf("%d ", &x);
add(i, x);
}
}
int sum(int poz)
{
int k = zeros(poz);
if(poz - k > 0)
return aib[poz] + sum(poz - k);
return aib[poz];
}
int find_(int a)
{
int st = 1;
int dr = n;
while(st <= dr)
{
int mij = (st + dr) >> 1;
int aux = sum(mij);
if(aux == a)
return mij;
if(aux < a)
st = mij + 1;
else
dr = mij - 1;
}
return -1;
}
int main()
{
int m;
int c;
int a;
int b;
freopen("aib.out", "w", stdout);
freopen("aib.in", "r", stdin);
scanf("%d %d\n", &n, &m);
readArray();
while(m --)
{
scanf("%d %d ", &c, &a);
if(c != 2)
{
scanf("%d ", &b);
if(c == 0)
add(a, b);
else
printf("%d\n", sum(b) - sum(a - 1));
}
else
printf("%d\n", find_(a));
}
return 0;
}