Pagini recente » Cod sursa (job #102560) | Cod sursa (job #369176) | Cod sursa (job #3290163) | Cod sursa (job #1167054) | Cod sursa (job #2485957)
#include <bits/stdc++.h>
using namespace std;
int n, aib[100005];
ifstream fin("aib.in");
ofstream fout("aib.out");
void Update(int p, int x)
{
while(p <= n)
{
aib[p] += x;
p += (p & (-p));
}
}
///sum a[1..p]
int Suma(int p)
{
int s = 0;
while(p > 0)
{
s += aib[p];
p -= (p & (-p));
}
return s;
}
///cauta cea mai din stanga pozitie poz cu sum a[1]+..a[poz] = s
int CautBin(int p, int s)
{
int st, dr, poz, mij;
int sum;
st = 1; dr= p; poz = -1;
while(st <= dr)
{
mij = (st + dr)/2;
sum = Suma(mij);
if (sum == s)
{
poz = mij;
dr = mij -1;
}
else if (sum > s) dr = mij -1;
else st = mij + 1;
}
return poz;
}
int main()
{
int i, m, op, a, b, x;
fin >> n >> m;
for (i = 1; i <= n; i++)
{
fin >> x;
Update(i, x);
}
while(m--)
{
fin >> op ;
if(op == 0)
{
fin >> a >> b;
Update(a, b);
}
else if (op == 1){
fin >> a >> b;
fout << (Suma(b) - Suma(a-1)) << "\n";
}
else {
fin >> a;
fout<<CautBin(n, a) << "\n";
}
}
fin.close();
fout.close();
return 0;
}