Pagini recente » Cod sursa (job #2469506) | Cod sursa (job #189460) | Cod sursa (job #2247739) | Cod sursa (job #849493) | Cod sursa (job #2190938)
#include <fstream>
using namespace std;
int BIT[100010];
ifstream f("aib.in");
ofstream g("aib.out");
int getSum(int index)
{
int sum = 0;
index = index + 1;
while(index)
{
sum += BIT[index];
index -= index &(-index);
}
return sum;
}
void update(int index, int val, int n)
{
index = index + 1;
while(index <= n)
{
BIT[index] += val;
index += index & (-index);
}
}
int main()
{
int n, i, m, val, c, a, b, ok, j;
f >> n >> m;
for(i = 0; i < n; i++)
{
f >> val;
update(i, val, n);
}
for(i = 0 ; i < m; i++)
{
f >> c;
if(c == 0)
{
f >> a >> b;
update(a-1, b, n);
}
if(c == 1)
{
f >> a >> b;
g << (getSum(b-1) - getSum(a-2)) << '\n';
}
if(c == 2)
{
f >> a;
ok = 0;
for(j = 0; j < n; j++)
{
val = getSum(j);
if(val == a)
{
g << j+1 << '\n';
ok = 1;
break;
}
}
if(ok == 0)
g << -1 << '\n';
}
}
}