Pagini recente » Cod sursa (job #777220) | Cod sursa (job #2519699) | Cod sursa (job #2343679) | Cod sursa (job #103078) | Cod sursa (job #1318281)
# include <fstream>
# define LSB(p) ((-p) & p)// formula pentru cel mai nesemnificativ bit de 1 al lui x
using namespace std;
ifstream f("aib.in");
ofstream g("aib.out");
int i,j,n,m,S,x,tip,a,b;
int AIB [100005];
inline void update (int val, int poz)
{
for(int i=poz; i<=n; i+=LSB(i))
AIB[i]+=val;
}
inline int suma (int poz)
{
int sum=0;
for (int i=poz; i>0; i-=LSB(i))
sum+=AIB[i];
return sum;
}
inline int cb (int S)
{
int ci=1, cs=n, mij;
while (ci<=cs)
{
mij=(ci+cs)/2;
int var=suma(mij);
if (var==S) return mij;
else if (S<var) cs=mij-1;
else ci=mij+1;
}
return -1;
}
int main ()
{
f>>n>>m;
for (i=1; i<=n; ++i)
{
f>>x;
update (x, i);
}
for (i=1; i<=m; ++i)
{
f>>tip;
if (tip==0)
{
f>>a>>b; //se adauga b la a
update (b, a);
continue;
}
if (tip==1)
{
f>>a>>b; //suma din intervalul a-b
g<<suma(b)-suma(a-1)<<"\n";
continue;
}
if (tip==2)
{
f>>S;
g<<cb(S)<<"\n";
}
}
return 0;
}